{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"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":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM10","name":"One transaction, one aggregate","shortDescription":{"text":"One transaction, one aggregate"},"helpUri":"https://codehealth.canine.dev/dimensions/DM10"},{"id":"DM11","name":"Constructible invalid state","shortDescription":{"text":"Constructible invalid state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM11"},{"id":"DM12","name":"Ambient inputs in the domain","shortDescription":{"text":"Ambient inputs in the domain"},"helpUri":"https://codehealth.canine.dev/dimensions/DM12"},{"id":"DM4","name":"Rich vs anemic model","shortDescription":{"text":"Rich vs anemic model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED3","name":"Event naming","shortDescription":{"text":"Event naming"},"helpUri":"https://codehealth.canine.dev/dimensions/ED3"},{"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":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"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":"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":"probe.advance (cyclomatic 114): probe.advance has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b06b0e17d57e22db8fc7c5e1504a5aa806d0f8ef87d3dc00bab4c57cc37510"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_protocol::grammar::validate_command (cyclomatic 87): mila_protocol::grammar::validate_command 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":"mila/rust/mila-protocol/src/grammar.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af30c6afc8cb3ddce66b599cee31169e574954b18303e58c8d27a049ec7f887"}},{"ruleId":"D1","level":"warning","message":{"text":"mounted (cyclomatic 83): mounted has cyclomatic complexity 83 (threshold 15). Most of this is not in the body itself: 4 of the 83 points are its own statements and the rest belongs to 17 function items inside it that branch (a function literal at line 730, a function literal at line 802, a function literal at line 682, \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":"marshall/assets/js/terminals.js"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83cb3a7f5f819f18394466c068539031a85867281e20ceb3d007a94eaac926a"}},{"ruleId":"D1","level":"warning","message":{"text":"collectFindingSemanticErrors (cyclomatic 71): collectFindingSemanticErrors has cyclomatic complexity 71 (threshold 15). Most of this is not in the body itself: 2 of the 71 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 491, 510, 521). 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dcfbb2c84e8a6896ac7ce73b079f5f5f58d26917f06f709eb67a1cd58d85c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Script::step (cyclomatic 69): Script::step 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d9ad6299148f1a604260c8861290c2e15c6ee969e097a93080eacb142f115f"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::pages::build_machines (cyclomatic 60): mila_native_linux::pages::build_machines 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":"mila/native/linux/src/pages.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9641b2e38b5ec71f043ffd9adf0e2cec50fcbe3c85e385b475103d44c491aec"}},{"ruleId":"D1","level":"warning","message":{"text":"preflightJsonText (cyclomatic 58): preflightJsonText has cyclomatic complexity 58 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 33 belong to 9 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3a024437c73a8ec150cd7560197ad191d2498a38a9e52e23cc893a5b45e522"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_named_integration (cyclomatic 56): scenarios.run_named_integration 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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1442246a8754ca17d757dc75e90b63bd4ea83b21be374b84901965313d46df4"}},{"ruleId":"D1","level":"warning","message":{"text":"validate (cyclomatic 51): validate has cyclomatic complexity 51 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 3 belong to 7 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"963346f29e230548f6bc38fe25654f5a192f5addc2198ad8e6141beff838744a"}},{"ruleId":"D1","level":"warning","message":{"text":"mounted (cyclomatic 49): mounted has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 217, 194, 209, \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":"marshall/assets/js/thread_composer.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead63034422605f927813dd49171751e1dee24fa0a90217ae8f933e0e9c292db"}},{"ruleId":"D1","level":"warning","message":{"text":"collectSchemaErrors::check (cyclomatic 49): collectSchemaErrors::check 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea75ef2e0df2e3380eacb3f405095f41ac2f3ca0673e1f8cee0f1ebeafc3ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_traces (cyclomatic 47): scenarios.run_traces 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d1f4d8207ce3d70d0015c7ce600363a4bb45c29b1512874d77e7e889ab4ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation._prepare (cyclomatic 46): preparation._prepare 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":"nix/domains/artifacts/host/preparation.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4636a9c60bffc26c806a985ec07278fc7c8c0fed585834c6d70de65afeaf9b33"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_zfs_namespace_unmount::sweep::sweep (cyclomatic 46): lilly_zfs_namespace_unmount::sweep::sweep 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":"lilly/native/zfs-namespace-unmount/src/sweep.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4640a7b0d80d65e4d1c48343114a20f2222922260344a5c52ecc67c89792f355"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.Main (cyclomatic 43): Program.Main has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/Program.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35fb00e235eb0aa7c214bbf6913d1fdf3cf9efb8900fa964bdd8f47cb0c076c"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsView.body (cyclomatic 41): SettingsView.body 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ec98fa6d95b2c6fd4a8f82add075df89e74aeec0ff80d82f495bdaf245ad0c"}},{"ruleId":"D1","level":"warning","message":{"text":"campaign.transition (cyclomatic 40): campaign.transition 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":"antithesis/verification/campaign.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"320bc6aa9113fd0998a631a762a408a633bdd56608a97008a79a3a0d2a714882"}},{"ruleId":"D1","level":"warning","message":{"text":"identity.verify_image_copy (cyclomatic 40): identity.verify_image_copy 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":"antithesis/verification/identity.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1419946fd58fc558ce3916cb427476dfda341e0db94d302acfcf0e75b220a92"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaNativeUiKt.MilaNativeRoot (cyclomatic 39): MilaNativeUiKt.MilaNativeRoot has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e633d56bd7bbcbe437d637ff39e20bb6e3c33f8dfd99d899ab7de29f9c3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"server.inventory (cyclomatic 38): server.inventory 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47369ade11bf23c07dff2764ebee51a99e0a69ddf3c49eb5131463af98964cb"}},{"ruleId":"D1","level":"warning","message":{"text":"enrollment.rebind_empty_lilly (cyclomatic 38): enrollment.rebind_empty_lilly 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":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae639346eb0a10f36e1b94fc56e48dbea9729e48d630e1e46167ddfb6cb8221"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalScreen::csi (cyclomatic 38): TerminalScreen::csi 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdabd48cf20a20f67b493d6c6e8505f65107490d607a29bfb4241d6a2eb85ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Outcomes.record! (cyclomatic 37): Outcomes.record! 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":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac046a0311093ffd04ae4dfb292217dc1827134a483a489efefda2aa989ea590"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios._physical_pressure (cyclomatic 37): scenarios._physical_pressure 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0690743f4752ec8ef3cfd0419abaccfd6d87b83cf3bd2dad9bc6fbb05c7a495"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios._published_head_effect (cyclomatic 37): scenarios._published_head_effect 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e048dd3dc75c864aff50e4888b9ba2f77c9583695ec232dba61bcc67848188"}},{"ruleId":"D1","level":"warning","message":{"text":"selection.validate_compose (cyclomatic 37): selection.validate_compose 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":"antithesis/verification/selection.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d4d588d4273090348de6d6cfdfbe02bcf683317257bfa19691f325ff15ae19"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaRouteParser.parse (cyclomatic 37): MilaRouteParser.parse has cyclomatic complexity 37 (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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"913f7931abf856ba705d32ae89f1fd2e66424a42782f630b769b99ab069c2760"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.load (cyclomatic 36): Config.load 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":"ziggy/lib/ziggy/config.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e0a15d0b514e03115bfb847258a8631da19ceb79743dc0c75a002ffa8ba54"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelCalls.queue (cyclomatic 35): ModelCalls.queue 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":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b85420b68b7f707e687617e1070a296a95b08712d22df14be91b743a791a2"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_native_admission_after_restart (cyclomatic 35): scenarios.run_native_admission_after_restart 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33b978e4e8f9d842c61719eeae4a9017b92ac28c5a27503ae3142e95f908db2"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::transfer::plan (cyclomatic 35): lilly_hostd::transfer::plan 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":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4f46f105dcca1a4640213a6fa341c30ca857dac0c8ff0eb26831653d498215"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.load (cyclomatic 34): Config.load 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":"lilly/lib/lilly/control/config.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b32204fecbeadac743059a3aaa4da21b91bf5407edfb85d90f2e58f3bd5df20"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalScreen::decode_sixel (cyclomatic 34): TerminalScreen::decode_sixel 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63ddfd209f70368aa8b1413ff1f3f4a554c4f839088d8aff0ef96b9fdadef59"}},{"ruleId":"D1","level":"warning","message":{"text":"loadingFinished (cyclomatic 34): loadingFinished has cyclomatic complexity 34 (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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb455fcc147613573d7c47e7b2c433edbc993bec667a8f27a096ce80e2a24f2"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaTerminalFrame.Decode (cyclomatic 33): MilaTerminalFrame.Decode has cyclomatic complexity 33 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 8 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":"mila/windows-dotnet/Interop/TerminalSession.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfda2eec837e6a1e2ceb9f82c1b6ddff2112c92ef6efd4478caa2e1903584f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.valid_transition? (cyclomatic 33): Checkpoint.valid_transition? has cyclomatic complexity 33 (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":"lilly/lib/lilly/lifecycle/checkpoint.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05cb84f8bdc33573b275081b1399c44dc6ecfa0f094df3f1e9db31173ce3dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_key_survives_archive (cyclomatic 33): scenarios.run_key_survives_archive 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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c84ace4744223bfe563945cf1b35e74235843a4319526e9d17efb892b52aee"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.load_case (cyclomatic 33): runtime.load_case 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":"antithesis/workload/terminal/runtime.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"40936aad76e4fea4830c8090e329e3cc05bb88283b601a7eef7b1569073e2fae"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch_git.assemble (cyclomatic 33): fetch_git.assemble 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":"nix/domains/artifacts/guest/illumos_sdk/fetch_git.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d38063b6a73fc4b2f8bdf9d81f3d3c2e374b9fff099ccab582be7fb54f06bb"}},{"ruleId":"D1","level":"warning","message":{"text":"install.run (cyclomatic 33): install.run 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":"nix/domains/artifacts/guest/windows/install.py"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9a22d235b4c0b26cc706dbd4c0f4239e037574ecdef1fbebd88b2deb50d51"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::policy::ip (cyclomatic 33): lilly_hostd::policy::ip 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":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac0316b8bb0d210dc53274cc4804cd805a17f5e3be4bf122af6ac13747038d7"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaRouteParser.Parse (cyclomatic 32): MilaRouteParser.Parse has cyclomatic complexity 32 (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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e6705324f224996bcb44acb7c8e957271c4c6142b0e392b3a6c9b5c4648261"}},{"ruleId":"D1","level":"warning","message":{"text":"profile_readiness.recorder_host_ready (cyclomatic 32): profile_readiness.recorder_host_ready 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":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e36c9445c68bd4840bd1d2c2f648faf803bb9b2c3389545cb45bcf64b4ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"editor.run_login_code_reply_loss (cyclomatic 32): editor.run_login_code_reply_loss has cyclomatic complexity 32 (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":"antithesis/workload/satellite/editor.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66f2b9663f92965e80fd065de9cd09a968d9e9825f05f251dfa0f67dfd086a9"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::parse_options (cyclomatic 32): lilly_hostd::parse_options 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":"lilly/native/hostd/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f37e225c92b27c9a9f7d0cb74f6d52ee05fdb44da98d6d6b91e93c1bdcbef3"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::protocol::encode_request (cyclomatic 32): lilly_hostd::protocol::encode_request 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":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4152feccfdf00e8c2c701f66bdc3887236cbe3e7491924ed159852261f09df75"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalScreen::feed (cyclomatic 32): TerminalScreen::feed 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2043a84135d1cae6a5315f588984882bbec109bf6d38dd4f2ea4e6eaf9f59bc"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWhoamiDecoder.Decode (cyclomatic 31): MilaWhoamiDecoder.Decode has cyclomatic complexity 31 (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":"mila/windows-dotnet/Interop/SignInCoordinator.cs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb6623eb535f4dc3cb247d06647fa2a10aa7ce3d24b1a1bdde8920cb360564"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaTerminalStream.AttachGeneration (cyclomatic 31): MilaTerminalStream.AttachGeneration 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":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d209dec1e88de0c73ca7e059eccad7d7c7462f4aee3170039fae828e4f4408e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.policy (cyclomatic 31): cli.policy 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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecd098a9ad85b37e6148e566ac8cee6a9a8a72370d40b9d61ae0f4f25303654"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::pages::build_threads (cyclomatic 31): mila_native_linux::pages::build_threads 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":"mila/native/linux/src/pages.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"87264cf88c3f6a69f38e9eab2987830cdd214500d380b494a9bad0ff77864064"}},{"ruleId":"D1","level":"warning","message":{"text":"collectUnitErrors (cyclomatic 31): collectUnitErrors has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"712c63bcb6496a679368d288bed0b230cd3608cc0878345971a52c8c9a509883"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.decode (cyclomatic 30): Config.decode 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":"audi/lib/audi/config.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a6d8b22f7dcad51fec0b88769dd2ddf2e4b2d76ab112bfacbf925d40b372aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ClonePlacement.reserve! (cyclomatic 30): ClonePlacement.reserve! 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":"marshall/lib/marshall/compute/clone_placement.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd25286c77e01e773d29c3c8a78eaaa31262d8a3b0227ff185c216609e08c9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_input_probe (cyclomatic 30): scenarios.run_input_probe 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a463a28e3a8422d1baa1ef38c70340f962acdef9cdfc4f5cedc909658658ca25"}},{"ruleId":"D1","level":"warning","message":{"text":"control.effect (cyclomatic 30): control.effect 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":"antithesis/emulation/storage/control.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f5720f6e6c44ff5ec43a1f546b8d556f3c9152f6e42d035d39690b631961e"}},{"ruleId":"D1","level":"warning","message":{"text":"campaign.initialize (cyclomatic 30): campaign.initialize 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":"antithesis/verification/campaign.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba238a738f4e6c921eca6247133fe8d1535fb2ca765e4bad5b2dab169f2508b"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaRootContent.body (cyclomatic 30): MilaRootContent.body 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4806eccbee06d36a1fdd5b92d706fbf220e71d8018e92af77e69a1f701264dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::native_growth::gpt::read (cyclomatic 30): lyra::native_growth::gpt::read 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":"lyra/src/native_growth/gpt.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"32df8aad4433a9c7b1c6f167e5797210c4ac472986903c4c2e27bf304439280e"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::journey::run (cyclomatic 30): mila_native_linux::journey::run 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d0051550ab5cee4ff24822dc2c23ce5afaca94c17b121be709bef6894d1d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::views::build_terminal (cyclomatic 30): mila_native_linux::views::build_terminal 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":"mila/native/linux/src/views.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"af989d1dac12d5240a706ea895a6093736d006790b114d1f8b5e3da661b8ae5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplicationSession::thread_action (cyclomatic 30): ApplicationSession::thread_action 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":"mila/rust/mila-session/src/threads.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc52030f7396d2e58689eaaeaa074bb7aec860457443ad038d7ca304b3aeb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"validateAttempts (cyclomatic 30): validateAttempts has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 6 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 578, 616, 634). 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbfe6bfafe110b621e1033fab28d5dbef6db08761d0d4193868270f980867db"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaTerminalStream.PollRead (cyclomatic 29): MilaTerminalStream.PollRead 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":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03037575f3dc31997e5de416e8cc88a320e1e35e9a9290e954c5b84bc958cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.resume (cyclomatic 29): Driver.resume 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e313f4e759d838efcd60e70bb596e963d0a8653c99f4d20c47764719cede39"}},{"ruleId":"D1","level":"warning","message":{"text":"Prompt.admit! (cyclomatic 29): Prompt.admit! 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":"marshall/lib/marshall/agents/prompt.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8e56ddb70b507e32071dc80988da12cf65c1bbee37e81ce2000e5c66cd800b"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationCapacity.prepare! (cyclomatic 29): RelocationCapacity.prepare! 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":"marshall/lib/marshall/compute/relocation_capacity.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cad52f3ea2193472b43db4f2e91d0c2ef328e9da62f1cd5c79e058af556656"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationCoordinator.stop_confirmed? (cyclomatic 29): RelocationCoordinator.stop_confirmed? has cyclomatic complexity 29 (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":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0311891fc7369b812c58f0ee2383d8c742c8b519b177281c088058124de3de1"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.run_magic_preview (cyclomatic 29): browser.run_magic_preview 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":"antithesis/workload/access/browser.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9828834708a825cf87fa9f967962bb5aee5444d1b5287bc7249a96fa97e88b08"}},{"ruleId":"D1","level":"warning","message":{"text":"verify_runtime.verify (cyclomatic 29): verify_runtime.verify 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":"nix/domains/artifacts/guest/native_git/verify_runtime.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2cd0c8dbead52b4ab164fe11754a69c918e5b0c0a5252a84ba0374847e4a81"}},{"ruleId":"D1","level":"warning","message":{"text":"serial_session.run (cyclomatic 29): serial_session.run 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":"nix/domains/artifacts/guest/omnios/serial_session.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d24dde61411832a590cf4824618d79d2e9b465a974f468a82958e66ac0fcc7c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validate (cyclomatic 29): cli.validate 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":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c3b2b2398b9cd669bd889c310ab253b559ce84b56e98e0ee640685eb05720"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployment.preflight (cyclomatic 29): Deployment.preflight 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d50b54570f985fa2da4dfc59e82e571f8620053c771746e8703bd147677d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_capacity (cyclomatic 28): scenarios.run_capacity 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"002fa099933d69fc4121b8c8fe2292aa11089a2856397b0a2625e21e4a08796b"}},{"ruleId":"D1","level":"warning","message":{"text":"assertions.python_calls (cyclomatic 28): assertions.python_calls 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":"antithesis/verification/assertions.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f79d3fcf30d0e80687652f2b9d0e1eeee17000f9c4363ebd7e7f3ffb00b375e"}},{"ruleId":"D1","level":"warning","message":{"text":"packaged_instrumentation.run_suite (cyclomatic 28): packaged_instrumentation.run_suite 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6708ff1e3216d49f154e59861219f61a5fdf87618302192d102e4f013e1eb22c"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_cell.generate (cyclomatic 28): rust_cell.generate 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":"nix/buck/rust_cell.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"56480728f02ee4813f6d67a209de071e5cb6e57f690ca4caf6d27a4366d05f92"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.collect (cyclomatic 28): runtime.collect 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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cbf3caa286ca12d3a5808c9ac856f55bd5271f1287615ea4a14b6dcd5abda3"}},{"ruleId":"D1","level":"warning","message":{"text":"enrico_git_owner::stream (cyclomatic 28): enrico_git_owner::stream 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":"enrico/native/git-owner/src/main.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1564fcf9c744a46023b0e2ae1284ff3b7af8987eb9fa34af50b5aeefa7386aca"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::handle (cyclomatic 28): Session::handle 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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265d18ea33d4fd750fee3fb98354085066a194e21f6682f1b8fae486807fdda"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveSession::subscribe (cyclomatic 28): LiveSession::subscribe 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":"mila/native/linux/src/session/watch.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"51786799e560e7ad3f0db7e92fe5f5080fc9fbaf9a463e8ed3d310f33e254c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationReadinessState.activation (cyclomatic 27): RelocationReadinessState.activation has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_readiness_state.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"691caa438810c672d6fb144526e07d0caa6e9a650a4fbce2432de13c819cd0bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.current! (cyclomatic 27): Execution.current! has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d79b89fb889dc4034e10c6f1dee6f7b04768cdeea92961b4fc12555477efe44"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.probe (cyclomatic 27): bootstrap.probe 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":"antithesis/workload/core/bootstrap.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e594ebcd33c1ff0e3e8c31cde9b7dbdb71d7ab85f2fa76837ff4893608efa908"}},{"ruleId":"D1","level":"warning","message":{"text":"campaign.reserve (cyclomatic 27): campaign.reserve 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":"antithesis/verification/campaign.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04e1d30280a89d86624f6d7ab8a3575c28538c3fda7fe89b908ee919052f482"}},{"ruleId":"D1","level":"warning","message":{"text":"Snapshot.render (cyclomatic 27): Snapshot.render 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":"nix/domains/system/fleet-exporter/exporter.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90a412a280e7f7ea9b4cee8254baceac619c0c87d0b1312457c35248e0c81d3"}},{"ruleId":"D1","level":"warning","message":{"text":"JourneyDescriptor::parse (cyclomatic 27): JourneyDescriptor::parse 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"41afb17033ebbfca6e2675ba121ba4a6f94eab1c50b3b785caf7183c7eca3464"}},{"ruleId":"D1","level":"warning","message":{"text":"sectionReadiness (cyclomatic 27): sectionReadiness has cyclomatic complexity 27 (threshold 15). 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, 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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a495791557b490599a44761717e2b01593a2f9c6df7f5f7c576fad4796c40f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWindowsPushRegistration.RegisterAsync (cyclomatic 26): MilaWindowsPushRegistration.RegisterAsync 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":"mila/windows-dotnet/Interop/WindowsPushRegistration.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf8b31352e847e5da0247044f5459417746b43831cf1a95a0313d09534c13be"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestWitness.current_replay_binding (cyclomatic 26): GuestWitness.current_replay_binding 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a9c0504167c2d317c8073609235846fd42158f457d16f317fd4b8c19bfe0bd"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.native (cyclomatic 26): CheckpointStorage.native 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ab5b790d6d4a35963fc2d105918fe6a8719035a18cb109a901926440b8b72e"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.run_remembered_revocation (cyclomatic 26): browser.run_remembered_revocation 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":"antithesis/workload/access/browser.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6970e0acf78d63646b2fd73eb0f11f67d74187c166d253379009fdbd9329bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"spool.read_slots (cyclomatic 26): spool.read_slots 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":"antithesis/workload/satellite/spool.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa66b8daf44c21c006dbb6ac9be2691f4fbca1b4c502294e2598ac5342d861d2"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_parity.main (cyclomatic 26): rust_parity.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":"buck/rust_parity.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3ab22fa700026b90b9d0bc082f957b541c013f5250d989115eea16e4322f47"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_source_export::run::run_sender (cyclomatic 26): lilly_source_export::run::run_sender 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":"lilly/native/source-export/src/run.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25c414354a544043ad5ece07c36d990d4605c0d3b2b43346e1e056c7648bdb2"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::gtk_journey::page_steps (cyclomatic 26): mila_native_linux::gtk_journey::page_steps 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8554f704d9b6c98c78053647bc824ff6a4dea16c70a8ec58603cdf0facf970f"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::journey::run_pages (cyclomatic 26): mila_native_linux::journey::run_pages 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b366d64203048f3a5718787123e8dd63edd153d759f1de7293ad2d0d6f3c4726"}},{"ruleId":"D1","level":"warning","message":{"text":"mounted (cyclomatic 26): mounted has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 8 function items inside it that branch (key, click, setOpen, \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":"marshall/assets/js/workspace.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07cc39fcdd1b98d7900e26b81398c9f8e7710b805499e476140e8d14b7f67c"}},{"ruleId":"D1","level":"warning","message":{"text":"parseRunRow (cyclomatic 26): parseRunRow has cyclomatic complexity 26 (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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9051488aa5851f4eab073acf4885803b30c253e4948abec436885b74cbea0164"}},{"ruleId":"D1","level":"warning","message":{"text":"ZFS.policy_shape? (cyclomatic 25): ZFS.policy_shape? has cyclomatic complexity 25 (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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24722fd9e8cc0503c576c00fd761f75ec929137afcf97d5b44f4e242fb2a10"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointTransfer.received_native (cyclomatic 25): CheckpointTransfer.received_native 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c15856fac3ebbf1a61e4d9cba1dc90925c3592da28f874ad98ea9faf892fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.new (cyclomatic 25): Config.new 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":"lilly/lib/lilly/vm/config.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7240a6ff59039b89b1b1899426e73803682cc966e7f1d99fa6992160e0151279"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadsLive.load (cyclomatic 25): ThreadsLive.load has cyclomatic complexity 25 (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":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24ef3652aecb3db64e622fbd223057690c3c6139f3d7cbc570bd8abed379caf"}},{"ruleId":"D1","level":"warning","message":{"text":"SSHHostCertificate.parse (cyclomatic 25): SSHHostCertificate.parse 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":"protocol/lib/overalls_protocol/ssh_host_certificate.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"906fe026f986994158a1e8d94968a097749aff782e4418609a2ddcb8394ab132"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.run_legacy_request (cyclomatic 25): dispatch.run_legacy_request 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":"antithesis/workload/control/dispatch.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dd40e4458adad1e9fd81239b22771c126543e2bcae1e566503022f280411fc"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_recovery (cyclomatic 25): scenarios.run_recovery 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df13364c2310f6b83a28acaf4840223e4f67a19e10401002a4fcef45c438f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_neighbor_progress (cyclomatic 25): scenarios.run_neighbor_progress 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0374249e83e38c20527de82bf827e8dd13cc63bebdd6c01905eeda1188bf50"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_kill_under_input_stall (cyclomatic 25): scenarios.run_kill_under_input_stall 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a074b67753d565fd11c1c2d336f887277f5e2f37ab3a05b2bf5d450fbefb4585"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 25): cli.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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65514179280f458a7807064d771724d4d393cefcd805d0a95528fa742973d47"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.main (cyclomatic 25): collector.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":"nix/domains/system/firecracker-logging/collector.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b3b897e279f464ec0819ab9e4b014255901f77bed31f740ebb797d62aa26bf"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls.Route (cyclomatic 25): overalls.Route 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":"nix/domains/artifacts/guest/github/transport/transport.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41cc5fd7ea3dd554c044501120b0b5f322937d89cf999dc1ebb049e1192160d"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_trace_spool::forward (cyclomatic 25): overalls_trace_spool::forward 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"db21b34d7c4d6d417dbb93876fc82cbe1ede36b7898432772021e9766ae67881"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_transfer_stream::run::sweep (cyclomatic 25): lilly_transfer_stream::run::sweep 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":"lilly/native/transfer-stream/src/run.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b71c24c1e5f5b61445638dfebe0e8b02cc5229501b0d5501d6806336a9d0de"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_vscode_web_broker::windows::files::descriptor_acl (cyclomatic 25): overalls_vscode_web_broker::windows::files::descriptor_acl 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":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d279fb1f030ae2c942044e8c0ab426b5abd0c1ef1a5dc6b5b8b7d3778ba3b"}},{"ruleId":"D1","level":"warning","message":{"text":"check-extension.main (cyclomatic 25): check-extension.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":"nix/domains/artifacts/vscode-web/check-extension.mts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e812ffe2bee9bf5fb69a7bf4def6c11419d15f8e2cbe67f2b02078f8f86580d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutorSession.with_attachment_command (cyclomatic 24): ExecutorSession.with_attachment_command 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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"24026288d1741881725ef1737b6b2f7d7e7aa7911858144e1b4d7a65199c8a39"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationSources.prepare_request! (cyclomatic 24): RelocationSources.prepare_request! 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":"marshall/lib/marshall/compute/relocation_sources.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ba1fab7c1c435e63d28515bac7fcbffea02726805214925f2b034c7a568ccc"}},{"ruleId":"D1","level":"warning","message":{"text":"ServiceLevels.ready_at (cyclomatic 24): ServiceLevels.ready_at 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":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15b16e950cfc65447005923f979d7eedc734e0b662da8a45feb44fb196471b0"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupHolds.settle_locked! (cyclomatic 24): StartupHolds.settle_locked! 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":"marshall/lib/marshall/compute/startup_holds.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e08e6f7396fbe7e1bacf7c8285d7be29b4f7f5f322c0ee0a50eebe439c897"}},{"ruleId":"D1","level":"warning","message":{"text":"Publications.snapshot! (cyclomatic 24): Publications.snapshot! 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":"marshall/lib/marshall/ingress/publications.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f55fa9d44788e1d0d013cedeb4ea9b5620c8269f224f9273737e03b8be8c88"}},{"ruleId":"D1","level":"warning","message":{"text":"Sharing.set (cyclomatic 24): Sharing.set 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":"marshall/lib/marshall/terminal/sharing.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"26148ad51cdfe3011216a2b7e9811ced8c4da7a5099808935c7dfb3a74e1a9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"envelope.decode (cyclomatic 24): envelope.decode 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":"antithesis/workload/control/envelope.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c63a2130ba6f389d82de8092c062c260740edab834f59aea1f960000f15d0"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_credential_revalidation (cyclomatic 24): scenarios.run_credential_revalidation 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":"antithesis/workload/control/scenarios.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"84181be0a2aa1e90e64fba08da8fab33afde268edb5e04ed29a011d9d73d9ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_replay_cap (cyclomatic 24): scenarios.run_replay_cap 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45c55357dc596180156c9378583fbe1c704fe0b3d71d649d3f03006fe10c831"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.stop (cyclomatic 24): runner.stop 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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d8332239c2aceba77bcc048d7c9bded1a60911d1c353adfb6f1ebb4b8577c1"}},{"ruleId":"D1","level":"warning","message":{"text":"server.dispatch (cyclomatic 24): server.dispatch 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da262ccd45b32f272b2fa7a37d75bf1101af9fa29b4a7bcb80421b0380d96b"}},{"ruleId":"D1","level":"warning","message":{"text":"publication.records (cyclomatic 24): publication.records 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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df1f8b16b63bc81ca1b4bcd4b6efc50dd1045c3ea81eb8b52370c1d3560a2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployment.healthy (cyclomatic 24): Deployment.healthy 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26e6c88b1928da0b149658d2c5bd24fb8ca94c2183f47b4963f301e667846a1"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.main (cyclomatic 24): runtime.main 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":"nix/domains/system/backups/runtime.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5477beaeda9864a2c50f8cf8cc720d246df3353146ffad04ecdf035465117b55"}},{"ruleId":"D1","level":"warning","message":{"text":"metrics.cgroup_metrics (cyclomatic 24): metrics.cgroup_metrics 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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9003d6c30a9c167c837636b768a9febff38ca162a26e3e4537f04ccd50446"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::policy::check (cyclomatic 24): lilly_hostd::policy::check 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":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"621988c15b354b71228d7613731186fd70aedd356ab55bcaf1c69b0929da3deb"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver::authenticated (cyclomatic 24): Driver::authenticated 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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8711dbe4b42857a1ff97123f8303cfce6085b399fcf2b0ffc5840284918d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaJourneyDescriptor.Parse (cyclomatic 23): MilaJourneyDescriptor.Parse 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. This is NOT this file\u0027s highest cyclomatic complexity: JourneySmoke.RunAsync (cyclomatic 29) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3918343bfffe7c04df081f50f2db771aeb7b3147ffbecae7a2726382f91b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestWitness.main (cyclomatic 23): GuestWitness.main 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7c51153eb5f0d575317dcc88978c4265e1a5dba9d68f1b2eb0eca9e828738"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.new (cyclomatic 23): Client.new 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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2984e9ae392c320b92003c2aaf247675505c2879436137c64529a1a5b9028f"}},{"ruleId":"D1","level":"warning","message":{"text":"ZFSDataset.resize (cyclomatic 23): ZFSDataset.resize 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f87194d4851527e80918c23407659c31f33aa3f59ef480c5c97c50c7fd2be"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.pause (cyclomatic 23): Driver.pause 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c478a6afef150a0d60542f20674dbdc9413515c546fd8363704445b3c48e2f95"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.lock_preparation! (cyclomatic 23): Context.lock_preparation! 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":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95835e12d70058fe12f34a68373236c247a228fe252795f7ff17f3cb9879958"}},{"ruleId":"D1","level":"warning","message":{"text":"Maintenance.transition_locked! (cyclomatic 23): Maintenance.transition_locked! 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":"marshall/lib/marshall/agents/maintenance.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1695f3665425336c50602d22041351c2b86f4a57d8452d700aa296232d60ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"RestartCapacity.check_source_restoration (cyclomatic 23): RestartCapacity.check_source_restoration 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":"marshall/lib/marshall/compute/restart_capacity.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcebfbb8cee1f47b560857b7875c98ade7df9a70d5f0d550c69b0a46fa4a5bab"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch._negative (cyclomatic 23): dispatch._negative 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":"antithesis/workload/control/dispatch.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65432699a1d07da6fe68700988561abac7294deefb241927bfbfd20b2ab740d"}},{"ruleId":"D1","level":"warning","message":{"text":"witness.parse_witness (cyclomatic 23): witness.parse_witness 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":"antithesis/workload/guest_lifecycle/witness.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68ae8505202900f8cafd58f9ffd74f83c13964228877832a493626be7a47533"}},{"ruleId":"D1","level":"warning","message":{"text":"monospace_browser_probe.check_thread_collaborators (cyclomatic 23): monospace_browser_probe.check_thread_collaborators 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":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c6c5dac530136111042dc5bef6c6d82fe097525f1082ce039b17f4bb27e4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"public_settings.validate (cyclomatic 23): public_settings.validate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/public_settings.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dd29111d6cec147df67b89cc0bb513c34e5942d7a09ac099be0e5470365a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"check_assembly.check (cyclomatic 23): check_assembly.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":"nix/domains/artifacts/guest/omnios/check_assembly.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66dcb8d6ae6d32ab5fd885d451b88d86e45f568a42b5743541eeb6027407066"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.prepare (cyclomatic 23): runtime.prepare 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":"nix/domains/system/logging/runtime.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0916aee327c5d35b1a890f1291d4a697bab437f84571fb84c85354d69fc848"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaApprovalDecoder.decode (cyclomatic 23): MilaApprovalDecoder.decode 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":"mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aed006a956e00520420a75ccb2b332fc08ec66a36ce213c26ef069efbbd24c5"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_trace_spool::run (cyclomatic 23): overalls_trace_spool::run 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fee3077b59c75e1cffd28db2d0bab89bf51d7b05d1b06a1845c24253cac2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Script::guest_tick (cyclomatic 23): Script::guest_tick 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed96c04761c12e3b5a7296601e535572007a3fca1902731e96b0deacfc670fb"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalScreen::sgr (cyclomatic 23): TerminalScreen::sgr 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"252d0f2c35d3452c2570d489c294bec365d1bf6ee6ccb498263bb76ab2c8cc6c"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchChannel::decode (cyclomatic 23): WatchChannel::decode 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":"mila/rust/mila-transport/src/watch_channel.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3accdd8b133b1bfad7db4e1e023817827d94620b3ccaa998bd2fb309e3749684"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_terminald::control_message (cyclomatic 23): lilly_terminald::control_message 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":"nix/domains/artifacts/terminald/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f9513d4b725722c715dbdc203d0d57e5eb315bde7f58be8f55dee19f479b8a"}},{"ruleId":"D1","level":"warning","message":{"text":"artifact_frame.parseRequest (cyclomatic 23): artifact_frame.parseRequest 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":"marshall/assets/js/artifact_frame.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bdba71be7a8ce7eecf4cc944a9c9fe73aeaa9066e29e022f0fc5d501607f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"probe.presentation (cyclomatic 23): probe.presentation has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa2de3a042c8c2f8d51859fab7630e9a014f79de4eef0cabc4ee3a4c56fc324"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.new (cyclomatic 22): Client.new has cyclomatic complexity 22 (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":"audi/lib/audi/control/client.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"32896c81f35076e9b85ea7e58a3a9053b89e3c0e6a84b86afb5a338e47807615"}},{"ruleId":"D1","level":"warning","message":{"text":"ZFSDataset.delete_owned (cyclomatic 22): ZFSDataset.delete_owned 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df6360fc4db86f731528625d3a51a05636ef6eb83b8f0eee2153bd356993270"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.poll_once (cyclomatic 22): Runtime.poll_once 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":"lilly/lib/lilly/inception/runtime.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a4ad0f6e13852143c4214dbf4c30930ac8fffb1d0e291a4610e5482df68b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Source.execute (cyclomatic 22): Source.execute 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":"lilly/lib/lilly/transfer/source.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf030f1cb33b19590b523099f61830dca514cd501fee98a6370bbefe70199c"}},{"ruleId":"D1","level":"warning","message":{"text":"Outcomes.apply! (cyclomatic 22): Outcomes.apply! 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":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c234c3fad6866e4fd030de0c2660cdc0a03b21cedf0f1b7673d5d5cc131d9e29"}},{"ruleId":"D1","level":"warning","message":{"text":"WebStreams.peer_authority! (cyclomatic 22): WebStreams.peer_authority! has cyclomatic complexity 22 (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":"marshall/lib/marshall/ingress/web_streams.ex"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b061b06aafe60fe81876b819d5edb92ad7dc52f4f298b77003fdc192ebd6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.load (cyclomatic 22): Config.load 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":"porsche/lib/porsche/config.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c6acaf7480d853c1fe61e7813f5cc7e37002d1d8a83f9270484b2987e62a54"}},{"ruleId":"D1","level":"warning","message":{"text":"browser.run_stale_admin (cyclomatic 22): browser.run_stale_admin 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":"antithesis/workload/access/browser.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51b39967d572e92f8e56dbce529d35b72f8e61013c9041a8a4b687ae2feffd0"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_physical_boot_cycle (cyclomatic 22): scenarios.run_physical_boot_cycle 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":"antithesis/workload/guest_lifecycle/scenarios.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"036d67902937250e1562a7685c035ae7c29f9526b8a1ea9591446e2c7fa9afa2"}},{"ruleId":"D1","level":"warning","message":{"text":"observer.read_snapshot (cyclomatic 22): observer.read_snapshot 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":"antithesis/workload/repository/observer.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9a8d911bcccf2d53956cca88f1ef8502f69423276a844d18b50c80f5c85e10"}},{"ruleId":"D1","level":"warning","message":{"text":"runner._run_registered (cyclomatic 22): runner._run_registered 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":"nix/verification/hegel/python/hegel/runner.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98cb0b43c4a87bf2498a467264a8c110f353bdee52c405c7579e3559d830956"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke.main (cyclomatic 22): smoke.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/storage/smoke.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c5542391beb014ddd75dec214ec56fbb2d5a3c4bf68d8c3ce097072e73b11d"}},{"ruleId":"D1","level":"warning","message":{"text":"selection.module_dependencies (cyclomatic 22): selection.module_dependencies 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":"antithesis/verification/selection.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7413a42c2f71b450d9f57bcc243ab87285c301cdaf67bacfb8ff52c6d4cf817"}},{"ruleId":"D1","level":"warning","message":{"text":"run.main (cyclomatic 22): run.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":"marshall/scripts/localization_browser/run.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9db349356d02c5e5416bcac9c78ca92e64bd773743ad486b8d6e5f593628b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch_sdk.parse_manifest (cyclomatic 22): fetch_sdk.parse_manifest 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":"nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e73535ad7c9409eca3546c41bc150268451be6f89eddd9ef9ef6cb8aee8e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.capture (cyclomatic 22): Runner.capture 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":"nix/domains/system/backups/runtime.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5ba11ef86112a7d656c7057fe4b551911cf06b97b0da1d4637c72440f20b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::run (cyclomatic 22): lyra::run 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":"lyra/src/main.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a83ef726afe443e298d310597e489661bc4b624f3914cf56a8b1b527293bed6"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_protocol::terminal::decode_attach_header (cyclomatic 22): mila_protocol::terminal::decode_attach_header 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":"mila/rust/mila-protocol/src/terminal.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d311f1b0c8d287b7f17a1caabc73f7c8fa02aca9846220181c96c8b1efb515"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaSignInCoordinator.AuthenticateAsync (cyclomatic 21): MilaSignInCoordinator.AuthenticateAsync 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":"mila/windows-dotnet/Interop/SignInCoordinator.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdef4ad2c6033e247aa4066da2efb866a108315f9c78eabf0eeea74101e31e82"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.cleanup_observation? (cyclomatic 21): CheckpointStorage.cleanup_observation? 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"f110870fbc504474451223d864047534c0db82807c71f90fb2a4b771fca9bca9"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor.reconcile (cyclomatic 21): Executor.reconcile 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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c551f01564a9b44bb70dfbaea9543081f235142d9e4e734d3398bbf0442cbd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.load (cyclomatic 21): Config.load 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":"susan/lib/susan/config.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d8f771f62436854fcf8b5a2798484a720e8806ac0378b448875f2cd54edfe0"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaFfiAdapterKt.parseMilaRoute (cyclomatic 21): MilaFfiAdapterKt.parseMilaRoute 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f2180a121f63b117e3f631d12b9edded26ed4223be79de4e0e2b462caa2093"}},{"ruleId":"D1","level":"warning","message":{"text":"host_sessions.run_credential_rotation (cyclomatic 21): host_sessions.run_credential_rotation 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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f0ba42776771bf89259c0c5abab6623245b9f6363bb91169eaf41c543a6ef"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceOracle.snapshot (cyclomatic 21): InferenceOracle.snapshot 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":"antithesis/workload/satellite/oracle.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"851e7070c4444f1c6e4e5976dffd8a28c20470beb35f5aba117d891edef55556"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.observe (cyclomatic 21): runner.observe 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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1ecb131d94e6f84d9c751d3204f63134dfbf3737e89f5209d862a388086a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"identity.verify_image_selection (cyclomatic 21): identity.verify_image_selection 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":"antithesis/verification/identity.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d626b81fd53c84132cd15589a6f0cab1c9ee9f59a30060ac88038f6cb831c81"}},{"ruleId":"D1","level":"warning","message":{"text":"selection.selected_files (cyclomatic 21): selection.selected_files 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":"antithesis/verification/selection.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8e73c8c2f7e16d66ed0370d2c260dccf126210ce277b6ecf4d93b00130cda4"}},{"ruleId":"D1","level":"warning","message":{"text":"packaged_instrumentation.parse_instrumentation (cyclomatic 21): packaged_instrumentation.parse_instrumentation 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"efefa7ab25e80f05a9ff7f42778c986a366c6a97fa43b10152ed64cb99b40cad"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployment.activate (cyclomatic 21): Deployment.activate 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5764c618dfcaa833a99b5acb05c8916917e1c3eee34504fc98f1ec2ddda94b"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::open (cyclomatic 21): Store::open 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":"elixir/diagnostics/native/spool/src/store.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"555afaf99577182a3bf5ebffb35ea8b916a609b627b5d44fbde4640f1438efd0"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::run (cyclomatic 21): lilly_hostd::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":"lilly/native/hostd/src/main.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3dc90820f9c55b3975cda90764735839633b808684b6b4db7b98d898ed49e6"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::agent::web_fetch::html_content (cyclomatic 21): lyra::agent::web_fetch::html_content 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":"lyra/src/agent/web_fetch.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae3bd1ea46383ff2d116fb6f8dc8edd95a47f91bc445e5e8e5b1470405573aa"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::native_growth::illumos_vdev (cyclomatic 21): lyra::native_growth::illumos_vdev 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":"lyra/src/native_growth.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"503aeea6dbdf56eafba6fcc429331eb741896c84e69189268fa260be3b7255b0"}},{"ruleId":"D1","level":"warning","message":{"text":"PtyTextDecoder::decode (cyclomatic 21): PtyTextDecoder::decode 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: mila_native_linux::terminal_text::encode_key (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":"mila/native/linux/src/terminal_text.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc4e434fd9a8b00ef25ef9cc6b6137a2f99f2acca54788e553c3f64d4d5b009"}},{"ruleId":"D1","level":"warning","message":{"text":"enforceJsonTextLimits (cyclomatic 21): enforceJsonTextLimits has cyclomatic complexity 21 (threshold 15). Of this number, 17 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1e3a833d18ef0fdccf7412cdbc46a58479db0910b3bfe26dcc46dd1b15e1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWebEndpointDecoder.DecodeCore (cyclomatic 20): MilaWebEndpointDecoder.DecodeCore has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WebEndpoint.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"535f710b2b7b858e17d597c2798da113694f5071dcf59b6eabe3da9d008e7ad3"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.phase_valid? (cyclomatic 20): Checkpoint.phase_valid? has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f59395155bcba5bea4903ef806a0265fe3682d91d3c1efd4ebdbd7d93d9e63d"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.verify (cyclomatic 20): CheckpointStorage.verify 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed104d7bf111f51256a1c2751cca590c4249b9de79a91ec67620d4f8d3e88c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Admission.allocate (cyclomatic 20): Admission.allocate 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":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750c18a023987ec22a045db3d8321033c3bbbbb36fa4a5d0c5c5172ac1145ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Evacuations.advance (cyclomatic 20): Evacuations.advance 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":"marshall/lib/marshall/compute/evacuations.ex"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a5a6f089a16f59e9afa5356984e1d41b91df9d08c75e5f9e3f772219f666b9"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationReceives.valid_source? (cyclomatic 20): RelocationReceives.valid_source? has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c73278926065ff1bdb72d2a9d5ecda0812d0608161ab03f0dfd5c74913e15d"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowServiceLevels.activation_evidence (cyclomatic 20): WorkflowServiceLevels.activation_evidence 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":"marshall/lib/marshall/compute/workflow_service_levels.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cfdb95126f0357701fd1a8781f2587b1af8dd3be79f5f7c0fb22857a686919"}},{"ruleId":"D1","level":"warning","message":{"text":"Authorizations.current_vm! (cyclomatic 20): Authorizations.current_vm! has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"611d17348902debf8001b5d0753c6ed65df165419afffa37c527be86e788ff81"}},{"ruleId":"D1","level":"warning","message":{"text":"Requests.current! (cyclomatic 20): Requests.current! has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/inference/requests.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d987c070fea5395efea50a76fa255d585215f89e536baf4e4f4f1ae7f83601"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.new (cyclomatic 20): Client.new has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/client.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d7b2cb02bacf3d51b778e671f27e4df0ed5874a8dbf4cb112c014e06b430db"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneControl.command (cyclomatic 20): CloneControl.command 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":"protocol/lib/overalls_protocol/clone_control.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcebdffe82349a045033924711f5e5afda18f210ba1242200d4d1b0545d1519e"}},{"ruleId":"D1","level":"warning","message":{"text":"Reflection.validate_guest (cyclomatic 20): Reflection.validate_guest 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":"protocol/lib/overalls_protocol/reflection.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2875450dadaf70f50c4c41995d07b3b73123bca778bdd3aa53c1549e9388cd44"}},{"ruleId":"D1","level":"warning","message":{"text":"host_sessions.run_session_successor (cyclomatic 20): host_sessions.run_session_successor 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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a26f91b1a9e36dea7be26953b33f0c305f055e9964385a50d40fb4ac42b58"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_replay (cyclomatic 20): scenarios.run_replay 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f07cfdb7c9a9248928c03120a578c910f6ff195f59b931ffebf2add3778dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.prepare_vm (cyclomatic 20): runtime.prepare_vm 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":"antithesis/workload/satellite/runtime.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a4f819b0f8b32ddc86bfa297cb4733a9f5f0ef6d3cd9ad81dff60b257fe9a"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_ring_budget (cyclomatic 20): scenarios.run_ring_budget 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce07e0d3bba99e9769fd4256a2ea4575d6cd6343c808f5ef74a979fa69f66b0"}},{"ruleId":"D1","level":"warning","message":{"text":"resources.policy (cyclomatic 20): resources.policy 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9081ba03f2a1a14d8527afc3cd825277f5f76f5312b908b84ba2f0cb5e64c5"}},{"ruleId":"D1","level":"warning","message":{"text":"resources.compatible (cyclomatic 20): resources.compatible 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32470fb77b55d8209621fcf2d294256660fa2c1d289458bb95664ec36c199b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::sanitize (cyclomatic 20): Schema::sanitize 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":"elixir/diagnostics/native/spool/src/schema.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e772b1bf49ad88b8c854b62c5c7b94c6e0fc9cb4bcc934ae78e3cd95b088e9"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_trace_spool::request (cyclomatic 20): overalls_trace_spool::request 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"837864cab9d271c1b64af603add135044e3ff3f1e0628fa93bf36c0cc09fae48"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeState::ensure_window (cyclomatic 20): NativeState::ensure_window 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":"mila/native/linux/src/main.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39c436d0a43b08f4d728842170623c24eb4b40a5cfcc7ec53823a9e0cf24abe"}},{"ruleId":"D1","level":"warning","message":{"text":"SignInFlow::apply (cyclomatic 20): SignInFlow::apply 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":"mila/native/linux/src/session/signin.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dcad5327c5235a32fb4c035025031496964803f0cc16b3a1b73abcd3dc8039"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_otel_guest_receiver::read_request (cyclomatic 20): overalls_otel_guest_receiver::read_request 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":"nix/domains/system/otel-guest/receiver/src/main.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc15a9b2435bed33501d560fd847c4c9dbeffceacab0f4604b7dd55a3d1d6953"}},{"ruleId":"D1","level":"warning","message":{"text":"validateChecks (cyclomatic 20): validateChecks has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 427). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef530a49e11792c10d7952781dd90f6984b8ee8e8dea0a2b2cf12ffad6eb23"}},{"ruleId":"D1","level":"warning","message":{"text":"validateDocument (cyclomatic 20): validateDocument 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ce01bca827fdb433c33988b51f163c993a15f9847e216edabbfed864a3a154"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestExecutor.current_boot (cyclomatic 19): GuestExecutor.current_boot has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c679a6cbbd20e4cf4c909c6f9a7b582917e7d4f085892ab8559dcd56e25a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"Hostd.reply (cyclomatic 19): Hostd.reply 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":"lilly/lib/lilly/host/hostd.ex"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"7470e6c2fd8764715ae6849f5239e8d3f4f35876d9ba13e5af5b6d1b95711a17"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportCleanup.cleanup (cyclomatic 19): ImportCleanup.cleanup 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":"lilly/lib/lilly/transfer/import_cleanup.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b99e9539a9f56d6f3281092d93bc225ae006e44cf61b67ec31f8a428745743e"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.valid_record? (cyclomatic 19): Checkpoint.valid_record? has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df109742e47a5030d1980d94d924bad0e7efd9e3367086d4395608496a60ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.mounts_valid? (cyclomatic 19): CheckpointStorage.mounts_valid? has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b4f471fb21f3875f8b6c0075184846d4a776f06e70950017dff2ebbc9a42ca"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelCalls.claim (cyclomatic 19): ModelCalls.claim has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fd02ded2c22b5937f3437a39f75ba8d9be6df34c931ac6796a597ade4b9935"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationDeletion.advance_locked! (cyclomatic 19): RelocationDeletion.advance_locked! 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":"marshall/lib/marshall/compute/relocation_deletion.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2f263d9aa1c745a9b2642baa4dc0bde3c5b9937e0113c34778b6e326b9be4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Wake.request_locked! (cyclomatic 19): Wake.request_locked! 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":"marshall/lib/marshall/compute/wake.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2865adac1cabd0eb86c2421652d065cf1232aecb3e9a08a7ac37a9edcb8b1752"}},{"ruleId":"D1","level":"warning","message":{"text":"Creation.reserve (cyclomatic 19): Creation.reserve has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/creation.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d05990ec9c14e890373d0baeb741c02c27bc5c06a76047d71dcd7af6460831"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaNativeUiKt.TerminalControls (cyclomatic 19): MilaNativeUiKt.TerminalControls 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"548ae74982fb3af24ff8204581548afaf9dc1361d7c06cd24f4daf572b78d69c"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_completion (cyclomatic 19): scenarios.run_completion 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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca281709d1f6e2ce245d36d10878d82e3b03c41c59581899028c8fbc8746af6a"}},{"ruleId":"D1","level":"warning","message":{"text":"scenarios.run_create_replay (cyclomatic 19): scenarios.run_create_replay 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3552e43513e62cb9ce9256a9225b197f0f7aaca9f7c37a088cfa00ff62b5458d"}},{"ruleId":"D1","level":"warning","message":{"text":"mila-tailnet-peers.watch (cyclomatic 19): mila-tailnet-peers.watch 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":".github/scripts/mila-tailnet-peers.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0e4e482694cb23cc1d2f43e188db264bee3289dea34c8a6c40f57d441b06cb"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.status (cyclomatic 19): runner.status 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":"antithesis/emulation/recorder/runner.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c353735a4b58e21633aa95aec2b5042fdd7f2a5986068eb642caa83d138af3"}},{"ruleId":"D1","level":"warning","message":{"text":"affected.select (cyclomatic 19): affected.select 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":"buck/affected.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e90332d3c1e09dc28bb03a5eb0dc808d90ddf66548e42dcc7fbf717b32a7e66"}},{"ruleId":"D1","level":"warning","message":{"text":"packaged_instrumentation.load_journey (cyclomatic 19): packaged_instrumentation.load_journey 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fb5fe83c344b6651c76610ead071dfa0d9bce9b5272e121b7542174322d7a7"}},{"ruleId":"D1","level":"warning","message":{"text":"storage.prepare (cyclomatic 19): storage.prepare 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":"nix/domains/artifacts/guest/inception/storage.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b4c8488a3b2cc56484a6445b9e5b8402e69d8eb94ec1363a5286f5dbc1d9f0"}},{"ruleId":"D1","level":"warning","message":{"text":"native_candidate.install (cyclomatic 19): native_candidate.install 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ce031f56a572a4c0d7b64ee5b58ddfcb498bfa58d02ff52b0ea0536406193"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaMachineWorkflow.submit (cyclomatic 19): MilaMachineWorkflow.submit 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":"mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31cf9ce0792e5904d45d1345407bc733fafba0b42edca9fbe2d1a0cec3236b"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWatchController.update (cyclomatic 19): MilaWatchController.update 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":"mila/native/apple/Sources/MilaNativeUI/MilaWatch.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a938f9843333e5f15078b7fc99a9c699986662a1b3388e06c71cd81c32807ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::journey::run_guest_terminal (cyclomatic 19): mila_native_linux::journey::run_guest_terminal 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c01c73d2681e84d0d6250ea3d8c1623156f943e7841f47bd4bfadf020c9091"}},{"ruleId":"D1","level":"warning","message":{"text":"AppLock::apply (cyclomatic 19): AppLock::apply 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":"mila/rust/mila-runtime/src/lock.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"75718aa9ea927315ce68a133f4914b8d9cebd5afdf8b323c4e9a950ae5a28729"}},{"ruleId":"D1","level":"warning","message":{"text":"Pane.attach (cyclomatic 19): Pane.attach has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 489, a function literal at line 502, lost, \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":"marshall/assets/js/terminals.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2b40709698fabeece9d87591bb46bf6cf9dae985540a7234586dd7c7bb7ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"mounted::verify (cyclomatic 19): mounted::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":"marshall/assets/js/admin_elevation.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"96241ce45fe12a5ae119185f788e13df852778a8dc9ef7ef2dae7de19f601698"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWatchStream.Run (cyclomatic 18): MilaWatchStream.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":"mila/windows-dotnet/Interop/WatchStream.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5067800cab5f029b6891fd4be257d2a5b54a9173e0c1e87394b3c7a978de1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Front.call_traced (cyclomatic 18): Front.call_traced 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":"audi/lib/audi/http/front.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee8883a016bb58739c0bcc0454e2c612f09e078b4a01cb350e3788156c3abe5"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketUpgrade.handshake (cyclomatic 18): WebSocketUpgrade.handshake 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":"audi/lib/audi/http/web_socket_upgrade.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ca7018bb34231b72786ca56b41f00d5a4b8ff059781019ce9c7b4ff0c9f3ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.handle_call (cyclomatic 18): Store.handle_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":"brady/lib/brady/cache/store.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a788f80e1ecbbbdc0b58c25c0f7fdd61cd6aff2b7a8f52ecea9f899481a610"}},{"ruleId":"D1","level":"warning","message":{"text":"Pool.new (cyclomatic 18): Pool.new has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/pool.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7757dd677d25d4f538ad209922cb511dd532be3e4a454d432a54eb3ce5f84714"}},{"ruleId":"D1","level":"warning","message":{"text":"Propagation.query (cyclomatic 18): Propagation.query 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":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ec4e7304040e21acbf1202dee54281237305ca2f96f017ff5f23ed45e8800"}},{"ruleId":"D1","level":"warning","message":{"text":"Receiver.pull_disk (cyclomatic 18): Receiver.pull_disk 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":"lilly/lib/lilly/transfer/receiver.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8e4eb7d8b0080073690c251ed3d39b7f6e4f343f7d99efdfdf773c1480b4a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Checkpoint.valid_leaf? (cyclomatic 18): Checkpoint.valid_leaf? has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"8673fa0d0bc61c5f28c40e6fd1002bc24f77b880e4cec2f4756dcd058f79d5ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.retire_transfer_destination (cyclomatic 18): Driver.retire_transfer_destination 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0aa30d389934bb4ea105204dd97990849806d4ba76f62510ec9153b65a0e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Journal.read (cyclomatic 18): Journal.read 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":"lilly/lib/lilly/vm/journal.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53cb149d3c0a98e0f67cf7520464521448e3b26fe8e08a2e46ecd482f75036c"}},{"ruleId":"D1","level":"warning","message":{"text":"Administrators.run (cyclomatic 18): Administrators.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":"marshall/lib/marshall/accounts/administrators.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a7552d76e825854db3b3394fe7b3c7328a29d7e61e50ef050a4bdea78a866a"}},{"ruleId":"D1","level":"warning","message":{"text":"CloneEffects.accept! (cyclomatic 18): CloneEffects.accept! 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":"marshall/lib/marshall/compute/clone_effects.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c7e921917e47e7b77e4bcc25a65fca890006925eef9a034b1fe1f527dc5fc"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationReceives.commands! (cyclomatic 18): RelocationReceives.commands! has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef8eba30ae29ec73124ed69230f060b62680b343c1aca1bb8949de86c8bbda"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationRestoration.confirmed? (cyclomatic 18): RelocationRestoration.confirmed? has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_restoration.ex"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc71a29c51bf17d09756a566e05b031b4e107cc175c3038284ef5c41556e5a"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.restore (cyclomatic 18): Request.restore 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":"marshall/lib/marshall/ingress/acme/request.ex"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"137a289edf5651a255f12f80e852b073b710808a57757396ba0d48ccfe8ec44e"}},{"ruleId":"D1","level":"warning","message":{"text":"SLOCheckpoint.decode (cyclomatic 18): SLOCheckpoint.decode 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":"ziggy/lib/ziggy/slo_checkpoint.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4438bce48228c0ec9a1eb8e8e7087e59679a6802e62f426315432cfd2cc7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaNativeUiKt.MachineDetail (cyclomatic 18): MilaNativeUiKt.MachineDetail 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. This is NOT this file\u0027s highest cyclomatic complexity: MilaNativeUiKt.ThreadDetail (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e78ccbd641b82f2e6509c02efb69f586a703f6fcc8ddb7a7eb1311400d4de4b"}},{"ruleId":"D1","level":"warning","message":{"text":"SatelliteOrigin.receipts_after (cyclomatic 18): SatelliteOrigin.receipts_after 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":"antithesis/workload/satellite/origin.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baca06271998ae277539101449399f4c9895e9f375abbdeffe99d61a90ffd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"guest._snapshot (cyclomatic 18): guest._snapshot 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":"antithesis/workload/terminal/guest.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1e9a4c416d0fd967cb47273817f2602b1c63592fed69cc751cf73588e8ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalOracle.create_history (cyclomatic 18): TerminalOracle.create_history 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":"antithesis/workload/terminal/oracle.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba9fd2f2acab7bb47e1af2e8af7c4be3f22b06dc995511c1ece3e4b40183ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"campaign.main (cyclomatic 18): campaign.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":"antithesis/verification/campaign.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13f746e9fbbe026dfeaa5bdbea60e0dcbcd4572550ad53acc6aaaa41387d20"}},{"ruleId":"D1","level":"warning","message":{"text":"identity.context_record (cyclomatic 18): identity.context_record 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":"antithesis/verification/identity.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f516a4576d6a2a329f8e944a44cdac795cb8a1f253bf9421a575fa2f6eec76"}},{"ruleId":"D1","level":"warning","message":{"text":"control_worker.process_category (cyclomatic 18): control_worker.process_category 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":"nix/domains/artifacts/guest/inception/control_worker.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"890c8b597c1276424af3bfe87fdc8d0ef0d77c8262f61507a08269f133235525"}},{"ruleId":"D1","level":"warning","message":{"text":"control_worker.supervise (cyclomatic 18): control_worker.supervise 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":"nix/domains/artifacts/guest/inception/control_worker.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"35723a72f3b8e43416980a49d9c3cfc7d08282e9c712da6431c7c875dd247502"}},{"ruleId":"D1","level":"warning","message":{"text":"publication.collect (cyclomatic 18): publication.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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34c64ec8c7e56f220cd390ed7ad7f299660c370a143bf54bdefed4b4bad9d09"}},{"ruleId":"D1","level":"warning","message":{"text":"native_image.check_effective_trust (cyclomatic 18): native_image.check_effective_trust 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ca4d3c48ac9329cf395d61e937444e82d3b7107dbfbd74bde38754e3ffbe8e"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_freebsd.extract_member (cyclomatic 18): extract_freebsd.extract_member 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":"nix/domains/artifacts/guest/native_git/extract_freebsd.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b65d19e67717f30005a07e2c87aa3365600660deeac2a8247c180c5600fbeb2"}},{"ruleId":"D1","level":"warning","message":{"text":"lookup.configuration (cyclomatic 18): lookup.configuration 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":"nix/domains/system/acme/lookup.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeefb64d5c5b4be39281cde1932706210e870c662112b1d15a5ed7cd09fe759"}},{"ruleId":"D1","level":"warning","message":{"text":"common.run (cyclomatic 18): common.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":"nix/domains/system/backups/common.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b003489516b135338a2183cbbff4254311c9765273ef9280c175dd27a64ab3a"}},{"ruleId":"D1","level":"warning","message":{"text":"backup_status.backup_status (cyclomatic 18): backup_status.backup_status 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":"nix/domains/system/fleet-exporter/backup_status.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22245bd43951254c0351f2beaa03956edc9111c3b38d059b2750499479c2931"}},{"ruleId":"D1","level":"warning","message":{"text":"metrics.device_metrics (cyclomatic 18): metrics.device_metrics 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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0b1bfbb6903347385a93767b63a8fe27b81135c3078659b61306c3c5e8cbea"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_ingress_bridge::run::bridge (cyclomatic 18): lilly_ingress_bridge::run::bridge 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":"lilly/native/ingress-bridge/src/run.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c0df1b889d8f3b4a0d5ff4c9a71052a059227eb15ae5d42ce8a8f571eecc9e"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::update::supervise (cyclomatic 18): lyra::update::supervise 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":"lyra/src/update.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab03c81d52e7335bf1f6544109146558f8caac306d509b73f7527b1d210f5bbb"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::views::display_terminal (cyclomatic 18): mila_native_linux::views::display_terminal 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":"mila/native/linux/src/views.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce777ee3e36bf99c2e2393d5d37e6a9f10618d3eced774cb7c73c36bf2cd51aa"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_native_linux::views::build_sign_in (cyclomatic 18): mila_native_linux::views::build_sign_in 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":"mila/native/linux/src/views.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11508bad251754fea4a2c0bc807054146af87740f5c2632945e5fedd373cf87"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_transport::cert::parse_host_certificate_blob (cyclomatic 18): mila_transport::cert::parse_host_certificate_blob 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":"mila/rust/mila-transport/src/cert.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f29ffe600bb11c24abdbf0c78ab5a5bdf17dfccaa2a7b150ea8a4d7d437d6c3"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_vscode_web_broker::mmds::response_head (cyclomatic 18): overalls_vscode_web_broker::mmds::response_head 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":"nix/domains/artifacts/vscode-web-broker/src/mmds.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dffeeb184fdbef75b5b66057f9facaf9113609e73a7fe224b86afe91a2b666"}},{"ruleId":"D1","level":"warning","message":{"text":"admin_elevation.verificationChallenge (cyclomatic 18): admin_elevation.verificationChallenge has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/admin_elevation.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1775db164cf79b2cfea54fe46d59793a3ad1f5a56c161cb3dc33449090cd3110"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaThreadListing.Decode (cyclomatic 17): MilaThreadListing.Decode 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. This is NOT this file\u0027s highest cyclomatic complexity: MilaThreadController.SubmitLive (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/ThreadListing.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3eceae23f47916a2a77d2f567822e915846a8906d474a6217e26038a4b62b3"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestBoot.decode (cyclomatic 17): GuestBoot.decode 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_boot.ex"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88c6c2968fd59d22c7e98434e6628484025c3fa10cce7363a37334b5f7724c4"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestExecutor.decode_observation (cyclomatic 17): GuestExecutor.decode_observation 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b0c7784b91eca1c0d2727794de5a947573299555bd8991f340217a444ad17b"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestWitness.sanitize (cyclomatic 17): GuestWitness.sanitize 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04aa4cc093b3298b21a4d97f7f9e2c559fa617fdd6753bec4a0013f812478e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Observed.ready? (cyclomatic 17): Observed.ready? 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":"audi/lib/audi/acme/observed.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c500abca358492d6dd668b22eb2b8e86b10385f7fc9d0c189ca7257866cdf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.decode (cyclomatic 17): Config.decode 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":"audi/lib/audi/config.ex"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a996aa4ec15222e2ceafbb6098a652498563487fc7c57152bf17ae724cbb9ac"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorAssetsProbe.check (cyclomatic 17): EditorAssetsProbe.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":"audi/lib/audi/http/editor_assets_probe.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4d8bd90e254269e7dfc8d3a9ab290eb8676ac379c6e310d84ab4563aa0b1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetWorker.fetch_if_due (cyclomatic 17): FleetWorker.fetch_if_due 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":"audi/lib/audi/tls/fleet_worker.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b50b0a1d04eb349dafd5b1fe42333b9d06537fb31fdb1ad6bec5ff4196dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"Pressure.validate (cyclomatic 17): Pressure.validate 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":"brady/lib/brady/cache/pressure.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a824ac80bb425d54e53d4a390aa6271195fcdc9596ab0f4e68a37e9a667d842"}},{"ruleId":"D1","level":"warning","message":{"text":"Proxy.exchange (cyclomatic 17): Proxy.exchange 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":"brady/lib/brady/proxy.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"13452e83e3ba29dead7c2c72505920d3bda96315db66e55ec7df9ca6bc53b028"}},{"ruleId":"D1","level":"warning","message":{"text":"Aggregate.validate_duration (cyclomatic 17): Aggregate.validate_duration 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":"elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ebc3921e9d728bc67ae83027037ef6f487ec1b39e39e73e65b70a74f69a424"}},{"ruleId":"D1","level":"warning","message":{"text":"ZFS.parse_status (cyclomatic 17): ZFS.parse_status 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f5adaead06e4e279753a0ba3467e40850f547456f7155d74216d83762fa49"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.init (cyclomatic 17): Server.init 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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e8d60596918c0f4be769e529f408621872904f396f8c324c08f73da19ea2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributionServer.init (cyclomatic 17): AttributionServer.init 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":"lilly/lib/lilly/network/attribution_server.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91ebdd6a586b8a4e3824d2814326d7e2e2b519ba81cc95d139acda3a0afa5fc"}},{"ruleId":"D1","level":"warning","message":{"text":"PermitJournal.grant (cyclomatic 17): PermitJournal.grant 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":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6469d9df24570b6991ee6511b7d7f7ec455868cbb5a047000dbac95795d68c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceivedDataset.verify (cyclomatic 17): ReceivedDataset.verify 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c58ce2a6748de44f4e73fa78111be3c98ac5a6df442b2904463dac5f1c5efe"}},{"ruleId":"D1","level":"warning","message":{"text":"Actor.handle_call (cyclomatic 17): Actor.handle_call 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":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d25af51d5680ef0bd180f5b028943669ce561b2193490551b4455219dc88282"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.cleanup_native (cyclomatic 17): CheckpointStorage.cleanup_native 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5461afdcb2d09b353658967dcaca32c6d4964513af9337b12fc134b2ee7ab08"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStorage.audit (cyclomatic 17): CheckpointStorage.audit 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb17d80139b92ca37b0ed04d2e624c4e0fab48313c7ebe76062c0b9f7857d8"}},{"ruleId":"D1","level":"warning","message":{"text":"HostReports.ingest_with_events_locked! (cyclomatic 17): HostReports.ingest_with_events_locked! 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":"marshall/lib/marshall/compute/host_reports.ex"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c95f1ef6b55a25ea48dfd9efeab5ead17f991ae9385f3bdf9bf9b46179c36"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationReadiness.accept! (cyclomatic 17): RelocationReadiness.accept! 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":"marshall/lib/marshall/compute/relocation_readiness.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f00aab0c0b11afa89a8c93a6ebcf1ecfd4608eff9eca8aa17a2b04a569b34"}},{"ruleId":"D1","level":"warning","message":{"text":"Resize.outcome_locked! (cyclomatic 17): Resize.outcome_locked! 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":"marshall/lib/marshall/compute/resize.ex"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c46a7ed46d6eef44a5733df841bb10bfd0719424c6ffc10c3fdd5c9ce06e146"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentPublications.exchange (cyclomatic 17): EnvironmentPublications.exchange 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":"marshall/lib/marshall/ingress/environment_publications.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b9699dd30eabc34c641cb75648ab7c5b8ad4be78e65ded90ea666abb2d770"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.discover! (cyclomatic 17): Execution.discover! 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":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e98a91e131c7aee1e1aa73ee53a57b281f4cc38ed089c0ad25023929fa295"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageManifest.validate (cyclomatic 17): ImageManifest.validate 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":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b48ee37d9ea7ec49c0357f5d4a69bf06729185ebabc1b00318e87b479dee41b"}},{"ruleId":"D1","level":"warning","message":{"text":"NestedStream.response (cyclomatic 17): NestedStream.response 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":"protocol/lib/overalls_protocol/nested_stream.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"787867e2dac7ae33eee6584e4ba1d3794de4a9760bb6da1a41d2ea7a19e76edf"}},{"ruleId":"D1","level":"warning","message":{"text":"OverallsProtocol.pool (cyclomatic 17): OverallsProtocol.pool 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":"protocol/lib/overalls_protocol.ex"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f04b6441867e4588554636478f908a57509494be8ddcb03d85099f866cd6b7"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaThreadDetailController.submit (cyclomatic 17): MilaThreadDetailController.submit 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee419bb60611d3d91aee9be04611cdbb516ddf541bfe6e7548d9cc68922d02b"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWatchKt.runMilaWatch (cyclomatic 17): MilaWatchKt.runMilaWatch 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaWatch.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"993154c2f54a1f6dfa3ff5a2067c998cfd9aa4fdf0b9e4d196d151346eec9b58"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputeOperator._call (cyclomatic 17): ComputeOperator._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":"antithesis/workload/admission/client.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c09e1b7e082d2472e89cf5835def758ce175028a2c5ea67e542abf3022f54f2"}},{"ruleId":"D1","level":"warning","message":{"text":"physical_scenario.run_measured_physical_capacity (cyclomatic 17): physical_scenario.run_measured_physical_capacity 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":"antithesis/workload/admission/physical_scenario.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b193e5b42058795b7f16b873cb6f4d4cd6447b8d299edf39dea355e2fc6987"}},{"ruleId":"D1","level":"warning","message":{"text":"credential.read_lilly_credential (cyclomatic 17): credential.read_lilly_credential 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":"antithesis/workload/control/credential.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa3a35376e05aa4038f86eaf5ea035c84c4c1555ed373632f1b0db69a204513"}},{"ruleId":"D1","level":"warning","message":{"text":"profile_readiness.repository_origin_ready (cyclomatic 17): profile_readiness.repository_origin_ready 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":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a647e3e5b4b9bdcb82994c6435fee0cf75105646fb435dce6659c2e8efdc46e6"}},{"ruleId":"D1","level":"warning","message":{"text":"domain.operation_view (cyclomatic 17): domain.operation_view 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":"antithesis/workload/guest_lifecycle/domain.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7edee0952ad71b6012232cd1a60c656acbcd2d504d806bb8565844fe5602eb"}},{"ruleId":"D1","level":"warning","message":{"text":"server.image_identity (cyclomatic 17): server.image_identity 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1990fde6fb7835f5139510cca6a552e0fcd57481c8ea0786307480db78a5d19"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.activate (cyclomatic 17): bootstrap.activate 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":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45500f5efec5b103c1a15aecb97e680dc44a9b69692a308ba87797ed8770353"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge.dispatch (cyclomatic 17): bridge.dispatch 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":"antithesis/emulation/recorder/bridge.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c579d4c98add5081110d3833a8e971b5d3cc30c4950c69ceeeabd061386a4e88"}},{"ruleId":"D1","level":"warning","message":{"text":"authority.issue (cyclomatic 17): authority.issue 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":"audi/priv/private_pki/authority.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2c78aa9580d9f2853c1d8cb797b1c545cadfece83928b5be5827af3655316c"}},{"ruleId":"D1","level":"warning","message":{"text":"monospace_browser_probe.run (cyclomatic 17): monospace_browser_probe.run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7dd381871dc466628f0638e7a25d843c04a50070f01fd515b0323ab3233e8e"}},{"ruleId":"D1","level":"warning","message":{"text":"verify_runtime.prune_illumos (cyclomatic 17): verify_runtime.prune_illumos 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":"nix/domains/artifacts/guest/native_git/verify_runtime.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff77ede8101ecd4be270822607e88d3ada8f21d3db344f6af8451a86fdb99d0"}},{"ruleId":"D1","level":"warning","message":{"text":"remote.storage (cyclomatic 17): remote.storage 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":"nix/domains/artifacts/host/remote.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b49d92a20a9bdf8d979604e8b9abd9e9f40e430fadf834dd0ebe3bdb16b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.metadata (cyclomatic 17): cli.metadata 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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"491002c90dcdeddc617a46e7adba4ec906faf982b8a908650644d8cda244641f"}},{"ruleId":"D1","level":"warning","message":{"text":"MachineDetailView.body (cyclomatic 17): MachineDetailView.body 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad16ae837b9cf1ea068055de215d4dda000c812937d4a5da9151e6a9d215ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_export_channel::serve::serve (cyclomatic 17): lilly_export_channel::serve::serve 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":"lilly/native/export-channel/src/serve.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa56b47778d29cf722fa2534abbcbb73a42cb412fb0cc1701ee6b007dde484e3"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_hostd::files::perform (cyclomatic 17): lilly_hostd::files::perform 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":"lilly/native/hostd/src/files.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"71871681aa515ec1d70a08a1b5c90409a38abe7d1fdbfa71c8848321880d7afc"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_ingress_bridge::run::run (cyclomatic 17): lilly_ingress_bridge::run::run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/ingress-bridge/src/run.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"724c971e5e30e6de541450bd8d44981bf979584dce5fddd6c680a4e2f277e720"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_zfs_namespace_unmount::plan::classify_line (cyclomatic 17): lilly_zfs_namespace_unmount::plan::classify_line 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":"lilly/native/zfs-namespace-unmount/src/plan.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ad4fe8f3fcad6db730cb6104e7ab8a0d99351c8e2ac10e3fed96b6837303c9"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::agent::attachment::execute_transfer (cyclomatic 17): lyra::agent::attachment::execute_transfer 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":"lyra/src/agent/attachment.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0bbd4f357a2c0d33abb8209f2764fcc9846302d2a52f8a47d3f97ea13dd81c"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_ffi::validate::trust::mila_trust_document_reconcile (cyclomatic 17): mila_ffi::validate::trust::mila_trust_document_reconcile 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":"mila/rust/mila-ffi/src/validate/trust.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc15e45a0a7debe9886cc7f2ba20282c0eb133321207386190a51e7895dc93a"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchChannel::read_within (cyclomatic 17): WatchChannel::read_within 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":"mila/rust/mila-transport/src/watch_channel.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"19495422359c870df1049e92d49fe35759ba7371f7cc0b6f1ada6e3dc238cd11"}},{"ruleId":"D1","level":"warning","message":{"text":"lilly_terminald::sys::pty::run_child (cyclomatic 17): lilly_terminald::sys::pty::run_child 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":"nix/domains/artifacts/terminald/src/sys/pty.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c70479f73bb8c4854890a1c5d453d08da3b438ca8ff820e7eae92c758bf85f0"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_vscode_web_broker::windows_main::probe (cyclomatic 17): overalls_vscode_web_broker::windows_main::probe 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":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"712659f8dd2b74dec9ed0e462f0d0c0d16def44646f43d67b63912840ca10ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaWindowsNotificationDevicesController.DecodeListing (cyclomatic 16): MilaWindowsNotificationDevicesController.DecodeListing 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":"mila/windows-dotnet/Interop/WindowsNotifications.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faf345da337151be61f8acaf390b9028c55b7f958f07331e8287c065a9cf227"}},{"ruleId":"D1","level":"warning","message":{"text":"MainWindow.RefreshMachines (cyclomatic 16): MainWindow.RefreshMachines 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":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"296236121e52eec2cf5fb772d248a98f8089cb711fe42b8685304430e443d79e"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestExecutor.start (cyclomatic 16): GuestExecutor.start 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b027705eafbefb49241eede34eb050141fedcf2bbd45be3e128c91e5065d1897"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestWitness.sanitize (cyclomatic 16): GuestWitness.sanitize 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6b9c1283e146f45053f56911cc62e8b32f93b77ebdfbc9b8aedcd9b90130c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.tls (cyclomatic 16): Config.tls 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":"audi/lib/audi/config.ex"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d92e5d4ce2385cace6e85f18cc720b747b35d1ef9e30b13a7b9973b2615a57"}},{"ruleId":"D1","level":"warning","message":{"text":"Pressure.read (cyclomatic 16): Pressure.read 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":"brady/lib/brady/cache/pressure.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec8a4e62ba29e145e2843cab63c8323eb1c23252b5c100055fd6882d97c138c"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.load (cyclomatic 16): Config.load 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":"enrico/lib/enrico/config.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38ee0a9382badb033e3bb73df9704ec5603af23beb80f337443e90f47523c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Git.refresh (cyclomatic 16): Git.refresh 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":"enrico/lib/enrico/git.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd23ebf93710789a4ba801e8860f8c56994a75bc6f4dc09f954ba50144f775c"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupSnapshot.create (cyclomatic 16): BackupSnapshot.create 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":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c444ac67b61a10d3c1517953daec65342a3c61edb1ff8ad879c1b08af93f1196"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupSnapshot.valid? (cyclomatic 16): BackupSnapshot.valid? 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":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d20d0321b5c126b493a46e327aaadb212f4bf74cf3e744e99cb1d34444b6a82"}},{"ruleId":"D1","level":"warning","message":{"text":"ZFS.classify_accounting (cyclomatic 16): ZFS.classify_accounting 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1916ebebb3a249e3381a1ef49dc64184c4f37f2d3f44ba802c8937bf50d84871"}},{"ruleId":"D1","level":"warning","message":{"text":"Server.init (cyclomatic 16): Server.init 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":"lilly/lib/lilly/private/server.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"137d947e494e0d4cfa050b8318e8642a40f7f2567124f2364bf31e2f1f04c930"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointTransfer.finish (cyclomatic 16): CheckpointTransfer.finish 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8d74899de5c10729deebefa12c0f1e7d799919cce9aed79200980c3dc0332b"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportJournal.for_intent (cyclomatic 16): ImportJournal.for_intent 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":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2ff784c756585b8a1c0511f6adbc7e176c243b457e0e79bdbb1d0c60e64f12"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceivedDataset.resume_token (cyclomatic 16): ReceivedDataset.resume_token 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b905e756a7d757e44f3ae582611969d7a0525dcfbf3d52c7c9d1844ef1f8ce4f"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceCleanup.snapshots (cyclomatic 16): SourceCleanup.snapshots 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":"lilly/lib/lilly/transfer/source_cleanup.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7e3d71c75cf90e5095c853c68e772b2cbf528aa47187dad68d198c23734b99"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceSnapshotCleanup.authorized (cyclomatic 16): SourceSnapshotCleanup.authorized 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":"lilly/lib/lilly/transfer/source_snapshot_cleanup.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c328987df59a784ff131155f83a95e81743cbdb1d982d15a8cbb4f3f11ee7cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceSnapshots.remove (cyclomatic 16): SourceSnapshots.remove 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":"lilly/lib/lilly/transfer/source_snapshots.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb6433a1e59b7d2e0b4aa22c1e849d3abc156a5da669c15f1b4b83d2b2032fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.retire_transfer_source (cyclomatic 16): Driver.retire_transfer_source 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d71281e4cf8c708961c881822bec0b24f448b8689030506eb0f0464e96a3cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop.next_step (cyclomatic 16): Loop.next_step 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":"marshall/lib/marshall/agents/loop.ex"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb8a6c08794e2159057beaa63cf23ec918dc00e8f427504d520ed8610baea54"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelCalls.apply_response! (cyclomatic 16): ModelCalls.apply_response! 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":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2b77b113d3bbb200afef5dd2276c0fe8c0a94c563d1029f2215b11c2d1f68"}},{"ruleId":"D1","level":"warning","message":{"text":"Skills.verify_result (cyclomatic 16): Skills.verify_result 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":"marshall/lib/marshall/agents/skills.ex"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895cf824e5d0a6b7c0b0b8ee59d9c7fc3bfda69dafbc7cd5735da47a7b4a49a"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadToolDispatch.claim_candidate (cyclomatic 16): ThreadToolDispatch.claim_candidate 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":"marshall/lib/marshall/agents/thread_tool_dispatch.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ad89663b4b0c82df99f50177d4e68d03a90b9d479b5ed15bc8e5626d4d9807"}},{"ruleId":"D1","level":"warning","message":{"text":"EvacuationViews.inspect_node (cyclomatic 16): EvacuationViews.inspect_node 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":"marshall/lib/marshall/compute/evacuation_views.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8e0b8ee8399add18a4d4ddaf512a53892ed6e5acbe8c7a8927d94f3079f746"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationCleanup.advance_locked! (cyclomatic 16): RelocationCleanup.advance_locked! 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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a67d75b472db73748de84c4392032f6cd23da24dd70bfbcba4f91532b2349a4"}},{"ruleId":"D1","level":"warning","message":{"text":"RelocationCleanup.deletion_confirmed? (cyclomatic 16): RelocationCleanup.deletion_confirmed? 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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1657cb726d8caad91cb022d2947277894186aaf0a65bf34baf29e424b4333115"}},{"ruleId":"D1","level":"warning","message":{"text":"Wake.admit_execution! (cyclomatic 16): Wake.admit_execution! 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":"marshall/lib/marshall/compute/wake.ex"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ef303418dfada3985eb1a9de4b5e7e449510e3f81ba9c91c1ff64cf36c8239"}},{"ruleId":"D1","level":"warning","message":{"text":"Relays.connection! (cyclomatic 16): Relays.connection! 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":"marshall/lib/marshall/ingress/relays.ex"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f046734a5c60d6f17fb3d6f2fff43e2734d737f17d6a17ef4b5fc6aa71a4c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeConfig.database (cyclomatic 16): RuntimeConfig.database 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":"marshall/lib/marshall/operations/runtime_config.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"46205b03698d805adff75d62e37d0e64e1b60aff431456e93edc5d2a6a3c98d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Authority.open_on_vm (cyclomatic 16): Authority.open_on_vm 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":"marshall/lib/marshall/terminal/authority.ex"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41d7dbbe76977301931064768793bf8d6736d1e12f6e6d561de35183ef90aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"Coordinator.execute (cyclomatic 16): Coordinator.execute 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":"marshall/lib/marshall/threads/coordinator.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2540f501e70f13dce1d7024b4706622a87f8c5510ca7bbf732cbd64b03abfc4"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStream.response (cyclomatic 16): EditorStream.response 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":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bbdd50d7f5683df99d2855d753947e0fb50794364234f22a7ec0f193bbf2b1"}},{"ruleId":"D1","level":"warning","message":{"text":"InceptionParent.validate (cyclomatic 16): InceptionParent.validate 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":"protocol/lib/overalls_protocol/inception_parent.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5baf8943696e94e4ef8be909191e60906efbe6c912047d4d4a88e37cf26fc"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentStream.recognized_pre_output? (cyclomatic 16): AgentStream.recognized_pre_output? 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":"ziggy/lib/ziggy/agent_stream.ex"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0014ada3d6a942d70ee7ef739d83d475da76d7dbdea6fa68234d85d635dd13"}},{"ruleId":"D1","level":"warning","message":{"text":"verdict.measured_capacity_verdict (cyclomatic 16): verdict.measured_capacity_verdict 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":"antithesis/workload/admission/verdict.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f1940d5685168e49c5d7628cbff868f7c4d86cfea8108993da1cf678e39af"}},{"ruleId":"D1","level":"warning","message":{"text":"statemachine.execute_state_machine (cyclomatic 16): statemachine.execute_state_machine 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":"nix/verification/hegel/python/hegel/statemachine.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"093c4bbfe5813a7a34ef9b8c4cde32a6a048b70feb915988bd1d5f24f42025b3"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_platform.parse (cyclomatic 16): mila_platform.parse 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":"buck/mila_platform.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5569dfa57f9117aad0530f774c60887eec3ad971b4e7d3b931be6bd6f88282"}},{"ruleId":"D1","level":"warning","message":{"text":"boot_report.report (cyclomatic 16): boot_report.report 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":"nix/domains/artifacts/guest/boot_report.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c50e16bb0cdba4124788b58b6fbc35e5dd89487ace75719383a053340e7468"}},{"ruleId":"D1","level":"warning","message":{"text":"enrollment.finish_completed_lilly_rebind (cyclomatic 16): enrollment.finish_completed_lilly_rebind 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":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b270069e07b71a5be137db886a0fc8f3fd2db23e4a16f330a21111986147e0b4"}},{"ruleId":"D1","level":"warning","message":{"text":"extensions.archive_entries (cyclomatic 16): extensions.archive_entries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddfb6865f4eb858166a4a5c7adf1266527d4f97b7c7abec1e1aa515579ccc90"}},{"ruleId":"D1","level":"warning","message":{"text":"Transition.prepare (cyclomatic 16): Transition.prepare 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a187fe7dea0f2a300edd750391c7ba6fc369823758c37f7a478e3298b590ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployment.run (cyclomatic 16): Deployment.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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"063cbe1c2a2162d673317ffd72c1771b529f6f47371700e868f3d5d5411c9181"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.main (cyclomatic 16): runtime.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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fbec94eefd12e0a950fbc75980091f8c47036928c8be154bab404bef3969ae"}},{"ruleId":"D1","level":"warning","message":{"text":"storage.prepare (cyclomatic 16): storage.prepare 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":"nix/domains/system/brady/storage.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4705517b9f427735c6e5810665812c244a1adaea1404e89c36e7a513c861d0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"metrics.host_metrics (cyclomatic 16): metrics.host_metrics has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd40ed3812811bb8a4dfb0cffa8b20aa6827743c6034e774bbdd114393faf1e"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkedMilaFFIAdapter.createMachine (cyclomatic 16): LinkedMilaFFIAdapter.createMachine 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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13356b6ac6f88860055c265a3c964a4305c63746b6bd12840c809dde5f35f0f"}},{"ruleId":"D1","level":"warning","message":{"text":"MilaTerminalFrame.decode (cyclomatic 16): MilaTerminalFrame.decode 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":"mila/native/apple/Sources/MilaNativeUI/MilaTerminalFrame.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda6d72088d034b608fea95d431ceb051efc84eba91f7d11e3c0c1ede2a6274"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::run (cyclomatic 16): Session::run 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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced391411775ebbec0b754b4dd38be38a93d4b9ef6fded223b66320603d3db9"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::transfer_stream (cyclomatic 16): Session::transfer_stream 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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"6227383e33b5d18d5e37540f06e1e5fccfb5d4aa96de5759607154d2871290b3"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::bin::overalls-native-workspaced::main (cyclomatic 16): lyra::bin::overalls-native-workspaced::main 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":"lyra/src/bin/overalls-native-workspaced.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc66a1d35b086fc7eb45decd4a4fbb5fc07f5cbfc6f60ae829fef93f56e39b"}},{"ruleId":"D1","level":"warning","message":{"text":"lyra::update::work (cyclomatic 16): lyra::update::work 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":"lyra/src/update.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fbd21c5f96e59b63cd02fb51fb6816e808d30e27431556720a9576306ff562"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::parse (cyclomatic 16): Command::parse 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":"mila/rust/mila-protocol/src/command.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d559df9483bd8332b5370dc7ff4112378a96d347ae71f6c14be7001419225899"}},{"ruleId":"D1","level":"warning","message":{"text":"mila_protocol::lex::lex (cyclomatic 16): mila_protocol::lex::lex 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":"mila/rust/mila-protocol/src/lex.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf728574677926ff19758dcc6cbff6763c8f60c668c8180b263a1e8b7614e52"}},{"ruleId":"D1","level":"warning","message":{"text":"Daemon::attach (cyclomatic 16): Daemon::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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f05cd36fc3578ad6be9fe7b51475ddca18eb13783a3222ad4c4af2a732e7500"}},{"ruleId":"D1","level":"warning","message":{"text":"overalls_otel_guest_receiver::sanitize::sanitize_metrics (cyclomatic 16): overalls_otel_guest_receiver::sanitize::sanitize_metrics 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":"nix/domains/system/otel-guest/receiver/src/sanitize.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd123fa1f6c18503d287825ee8a14e46b1d64cda4502c675fa2f5ecb93374428"}},{"ruleId":"D1","level":"warning","message":{"text":"thread_composer.refreshCommandAvailability (cyclomatic 16): thread_composer.refreshCommandAvailability 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 one function literal inside it that branches (line 19). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/thread_composer.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd5513474f61c509747a9c0bc830370c0988e34fbe79b62111b5f4ca9f60345"}},{"ruleId":"D1","level":"warning","message":{"text":"buildQuery (cyclomatic 16): buildQuery has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"959b75a27f38cc5e6fab581629ead6a0be7e77004a4a8b5050d21a5e74f68107"}},{"ruleId":"D1","level":"warning","message":{"text":"collectDataLimitErrors (cyclomatic 16): collectDataLimitErrors 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f66044a342f2d7332b13512f50ba69640948196685b0bc0d0cad78e514e4356"}},{"ruleId":"D2","level":"warning","message":{"text":"probe.advance (cognitive 168): probe.advance has cognitive complexity 168 (threshold 15). Drivers by points: if/else 59 (123 pts), boolean chains 37, ternaries 4 (8 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":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca1275cb12c91e5544f86a92e9bbc186c16b14bd4a9862e56ac0b4a6a81370"}},{"ruleId":"D2","level":"warning","message":{"text":"mounted (cognitive 115): mounted has cognitive complexity 115 (threshold 15). Drivers by points: if/else 45 (73 pts), boolean chains 23, ternaries 6 (14 pts), error handling 1 (3 pts), loops 2 (nesting depth added 38). Most of this is not in the body itself: 4 of the 115 points are its own statements and the rest belongs to 17 function items inside it that branch (a function literal at line 730, a function literal at line 802, a function literal at line 682, \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":"marshall/assets/js/terminals.js"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"515406d2ba99d33c0619ae86a99d114ca57e6dbbbb29f13e7a358f7e72e8dba7"}},{"ruleId":"D2","level":"warning","message":{"text":"Script::step (cognitive 104): Script::step has cognitive complexity 104 (threshold 15). Drivers by points: if/else 41 (79 pts), boolean chains 15, match/switch 4 (10 pts) (nesting depth added 44). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e162c6bb53280867af96804930f71625b51626ab9b21228850b3628dae5bd6d0"}},{"ruleId":"D2","level":"warning","message":{"text":"collectFindingSemanticErrors (cognitive 96): collectFindingSemanticErrors has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (53 pts), boolean chains 34, loops 5 (9 pts) (nesting depth added 27). Most of this is not in the body itself: 1 of the 96 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 491, 510, 521). 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec5aeaa516821e095d6e984e7600763a4cc693cd72cce8f81c8c97f90f7c0d3"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_protocol::grammar::validate_command (cognitive 86): mila_protocol::grammar::validate_command has cognitive complexity 86 (threshold 15). Drivers by points: if/else 38 (52 pts), boolean chains 32, 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":"mila/rust/mila-protocol/src/grammar.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cad97dcc333d0a9c9e13c46f4788f35223c52dae2477154a6ae575e6b039b8"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::pages::build_machines (cognitive 81): mila_native_linux::pages::build_machines has cognitive complexity 81 (threshold 15). Drivers by points: if/else 45 (61 pts), match/switch 10, loops 7 (8 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":"mila/native/linux/src/pages.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7833264b3760021255dcf1ae79ce089acb42020c95bf97b5935e131a3b12e747"}},{"ruleId":"D2","level":"warning","message":{"text":"validate (cognitive 81): validate has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 16, loops 3 (7 pts), ternaries 2 (5 pts), error handling 1 (4 pts) (nesting depth added 34). Of this number, 77 points are the body\u0027s own statements and 4 belong to 7 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd243aed54e91797daafa4e61ed0f2fdad33c51202cd69d758b0e7aac3916103"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.resume (cognitive 78): Driver.resume has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (69 pts), match/switch 4 (9 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fcf1ad92b633a4ef60e168e23117e9686ae03dbefa9d37309a62c4e1e7f9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"campaign.transition (cognitive 74): campaign.transition has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (58 pts), ternaries 4 (10 pts), boolean chains 6 (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":"antithesis/verification/campaign.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d02c39494ed6d58eb9f1adb25bd60f373af6dda388cda689f443bf113d9f962"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.main (cognitive 73): collector.main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 10 (37 pts), error handling 4 (16 pts), loops 6 (16 pts), boolean chains 4 (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":"nix/domains/system/firecracker-logging/collector.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3869ee2a4f905a1cd60d33c0087b6c0e210e7050b1adf88db607e90b32f71"}},{"ruleId":"D2","level":"warning","message":{"text":"collectSchemaErrors::check (cognitive 72): collectSchemaErrors::check has cognitive complexity 72 (threshold 15). Drivers by points: if/else 29 (40 pts), boolean chains 17, loops 4 (8 pts), error handling 2 (7 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"75145738911bb306b69448b644302f2d1d7e96f2a73c5bf1e41d71e4661004c8"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_zfs_namespace_unmount::sweep::sweep (cognitive 71): lilly_zfs_namespace_unmount::sweep::sweep has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 8 (20 pts), loops 3 (4 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":"lilly/native/zfs-namespace-unmount/src/sweep.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e6364ceda74e3fc87af9a18b2b80773ce6b9680d5b705cb4e81bb24c3bbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSnapshots.remove (cognitive 66): SourceSnapshots.remove has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (45 pts), match/switch 6 (20 pts), boolean chains 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":"lilly/lib/lilly/transfer/source_snapshots.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f534c4d34d2c3c3c6da046e31386ae210c527e49fc674f88c19d7327f8cc1ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_named_integration (cognitive 66): scenarios.run_named_integration has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 27, 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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f872a26ecd760f7b0d8cbbcb0c0264f7ab8845a0d0de71237a9a7418a41433"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_traces (cognitive 65): scenarios.run_traces has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 20, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84849ebaebb36e0f80160c9a4a6662a8b88e990b0499fbf9c8d39ef97ef633"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalScreen::decode_sixel (cognitive 65): TerminalScreen::decode_sixel has cognitive complexity 65 (threshold 15). Drivers by points: loops 9 (27 pts), if/else 8 (26 pts), boolean chains 10, match/switch 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad81ba002a042a815a4a80dcd652e0cf5e288ae7971d0cddf4115ea927c9615"}},{"ruleId":"D2","level":"warning","message":{"text":"server.inventory (cognitive 64): server.inventory has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 15, ternaries 3 (10 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8fb8cd5061a74916fd39cd87d6949d7a41f62b953e5ab8555dbe2bd001ec1d"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_git.assemble (cognitive 64): fetch_git.assemble has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 11 (17 pts), boolean chains 7 (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":"nix/domains/artifacts/guest/illumos_sdk/fetch_git.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2775f187d00bd4a8e30c34a89f6e4b96a5fb3ce8ee5b18f409c78449ac165fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"monospace_browser_probe.check_thread_collaborators (cognitive 63): monospace_browser_probe.check_thread_collaborators has cognitive complexity 63 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 8 (22 pts), ternaries 2 (11 pts), boolean chains 8 (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":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"78834ff8165e66998facdc52f49730511949a0249d1f43d31ac15d046733c192"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.pause (cognitive 59): Driver.pause has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (50 pts), match/switch 4 (9 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd34ab79212e596e4eb4783e2498953ab8d83bb36ed0acc27b9541f5e0bb0bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_cell.generate (cognitive 58): rust_cell.generate has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 11 (18 pts), ternaries 5 (12 pts), boolean chains 2 (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":"nix/buck/rust_cell.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0fb711860d9822c1261f014bca3a3a3349eb98d09e94b321782587f3169020"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.delete_owned (cognitive 57): ZFSDataset.delete_owned has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (50 pts), match/switch 2 (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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b908a3d45a3848e2750d353abc4e9cf9beed986334c820474f5c3348c11e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Outcomes.record! (cognitive 57): Outcomes.record! has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 14, match/switch 4 (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":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c9ced47c5e9886129cb42737af881841e2acd26d2942424e336480acdb19f7"}},{"ruleId":"D2","level":"warning","message":{"text":"selection.module_dependencies (cognitive 57): selection.module_dependencies has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (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":"antithesis/verification/selection.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7242d1f201e79beefcfe913a8e991e43ef76c020bb55cd772084650a0053c"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_source_export::run::run_sender (cognitive 57): lilly_source_export::run::run_sender has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 6 (19 pts), loops 3 (8 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":"lilly/native/source-export/src/run.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9304c62a02e68c51ef2a115ad3dd546363a91865e363518aafe8f6b2124da126"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation._prepare (cognitive 56): preparation._prepare has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 12, ternaries 4 (7 pts), loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/host/preparation.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3332f4f1fcbd816bdb2924b9070ee88fba074ce14fb51adcf0261e4b357866"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.verify_image_copy (cognitive 55): identity.verify_image_copy has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 12, ternaries 7 (10 pts), loops 4 (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":"antithesis/verification/identity.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54dd6bc786eddf442816e4df690c23fc4f18f1a428bd6b5d5453d6796903655"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.poll_once (cognitive 54): Runtime.poll_once has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 3 (7 pts), boolean chains 1 (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":"lilly/lib/lilly/inception/runtime.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3c838a107afcb2180485b45f1c7695c05572410d05093350be98fa0b6cb9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveSession::subscribe (cognitive 54): LiveSession::subscribe has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 7 (11 pts), boolean chains 3, match/switch 1 (3 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":"mila/native/linux/src/session/watch.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649dfa1bb0b446a11197d230da4b001208c56fd8013d9a6dfcc492ae5e5c17b"}},{"ruleId":"D2","level":"warning","message":{"text":"mounted (cognitive 53): mounted has cognitive complexity 53 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 16, ternaries 3 (5 pts) (nesting depth added 7). None of this is in the body itself: all 53 points belong to 11 function literals inside it that branch (lines 217, 194, 209, \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":"marshall/assets/js/thread_composer.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"314d1f70482b504b1c646be815d9ab7959f2aa01a264f19999b9fba6179a26f4"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios._published_head_effect (cognitive 52): scenarios._published_head_effect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 14, loops 3 (5 pts), 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b676d8aa4de1f4f89b9842c80f8a34f065b25ffa73b1c78c428f0c217f231bb"}},{"ruleId":"D2","level":"warning","message":{"text":"selection.validate_compose (cognitive 52): selection.validate_compose has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 6 (10 pts), boolean chains 3, ternaries 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":"antithesis/verification/selection.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5a16753f112acecc33567b679bc0ea61a0852686923fc565309db8f5f806d8"}},{"ruleId":"D2","level":"warning","message":{"text":"enrollment.rebind_empty_lilly (cognitive 52): enrollment.rebind_empty_lilly has cognitive complexity 52 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 6, loops 4 (5 pts), error handling 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":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9431e4006f9f900784f5d8eb743c8dec06ad9f6cb3d9b56c71b161ac44c3a72c"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationSources.prepare_request! (cognitive 51): RelocationSources.prepare_request! has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 9, match/switch 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_sources.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc8cc0903d835ac43c7a8ad4b77ee3d2471fed1f5f1caa8c5574fbfad0bd0df"}},{"ruleId":"D2","level":"warning","message":{"text":"enrico_git_owner::stream (cognitive 51): enrico_git_owner::stream has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 4 (11 pts), boolean chains 3, 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":"enrico/native/git-owner/src/main.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78e0c9a14839ecf53c97f4ff62e8813fcb50b965f73bdde3ba8946d0a9845d1"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_transfer_stream::run::sweep (cognitive 51): lilly_transfer_stream::run::sweep has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 6 (20 pts), loops 3 (6 pts), 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":"lilly/native/transfer-stream/src/run.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"db58b21a4ba6452c234be456aff450f353b7c49c9013b8aac5187bf8808a72fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Git.refresh (cognitive 50): Git.refresh has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 2 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"enrico/lib/enrico/git.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb9ddede2698a76071e4ab9ab849496747925d9f900459de0323a2b8130dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsView.body (cognitive 50): SettingsView.body has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 9, ternaries 7 (9 pts), error handling 1 (2 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e150d7623babef4dc6fc2d1962047c466a30110611e7453bc34cdede0e31e42c"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.recover_delete_mount (cognitive 49): ZFSDataset.recover_delete_mount has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (33 pts), match/switch 5 (15 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea753d5eb2935f6e3eda2785af3c1f36765b6435f59a848e64d72e56d4fb8b8"}},{"ruleId":"D2","level":"warning","message":{"text":"install.run (cognitive 49): install.run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 2 (6 pts), boolean chains 5, loops 3 (5 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":"nix/domains/artifacts/guest/windows/install.py"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1d0bb852b41180128b7592fce8276c78f093efb6c765695efbd478f5d1e6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"run.main (cognitive 48): run.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 5, loops 2 (5 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":"marshall/scripts/localization_browser/run.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"48087ae8f42a4033966eeccc3d70e2b79af4f30443c7a9f859af59ad401f0af7"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_runtime.verify (cognitive 48): verify_runtime.verify has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 6 (10 pts), loops 5 (6 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/native_git/verify_runtime.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bf3bd796de673ca41834185450b07d58d4182d54bc4f54d1bba350510aef48"}},{"ruleId":"D2","level":"warning","message":{"text":"serial_session.run (cognitive 47): serial_session.run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 7, error handling 1 (3 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":"nix/domains/artifacts/guest/omnios/serial_session.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cdee65e263cb19564e70779f69e0c57cd19ba11dede117c9e45028864b08c4"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::transfer::plan (cognitive 47): lilly_hostd::transfer::plan has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 7, loops 3 (6 pts), match/switch 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":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15726b794297ed38632a38045bffa051e0027fbc8f93cc0957830a18d9df6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_key_survives_archive (cognitive 46): scenarios.run_key_survives_archive has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7, ternaries 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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2139031449998fd88b612f09bdd414df658da7dc3b7c355a3fd6e72d6bc837a1"}},{"ruleId":"D2","level":"warning","message":{"text":"publication.records (cognitive 46): publication.records has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 8, loops 3 (7 pts), ternaries 2 (6 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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73b532128014b0d8e362886bcd53f1ba4fb2f17cbcb868b12791b068b0ac92c"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalStream.AttachGeneration (cognitive 45): MilaTerminalStream.AttachGeneration has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb8784dd68e7c22456f5f4ccdeb2b0010a45e7216ab52686de5a30579c5016"}},{"ruleId":"D2","level":"warning","message":{"text":"runner._run_registered (cognitive 45): runner._run_registered has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (11 pts), error handling 3 (7 pts), ternaries 1 (3 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":"nix/verification/hegel/python/hegel/runner.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0bb2ef246875967ac1c3ea35c65027feec57f5cff68286b40e7c4d26464b05"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployment.preflight (cognitive 45): Deployment.preflight has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (3 pts), error handling 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ea82aeb48d7d8e32a6c3d1b80b088b5326844e84eea1467b272205da352666"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaSignInCoordinator.AuthenticateAsync (cognitive 44): MilaSignInCoordinator.AuthenticateAsync has cognitive complexity 44 (threshold 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":"mila/windows-dotnet/Interop/SignInCoordinator.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc57f16c029d54abba56dd82fcc62ff30bcff7453d9993d3390b1f550bea6fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.provisioned (cognitive 44): Driver.provisioned has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 6 (15 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6abd566467f356fcfe41fa20b87ba9bd80db3dbcf702ea83d5633394cdc3b3a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.policy (cognitive 44): cli.policy has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 11, loops 4 (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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cdb2dc0b3f448d10c435047aceef0e9b7951716606a6f54447113753c18d4"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.cgroup_metrics (cognitive 44): metrics.cgroup_metrics has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 4 (7 pts), boolean chains 6 (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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0842781aee7d6d8bb776ff24ef7d3221f8f56dec3830e5c37a68480cb460536"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaRouteParser.parse (cognitive 44): MilaRouteParser.parse has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 22, if/else 9 (13 pts), ternaries 3 (8 pts), match/switch 1 (nesting depth added 9). 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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e399b5b4061b1e2c627fe662369c7da9391e12560e7938e91137adbae3839627"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::sanitize (cognitive 44): Schema::sanitize has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (10 pts), match/switch 1 (5 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":"elixir/diagnostics/native/spool/src/schema.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a0f449b543dc841accfc8fafc71156fd6b28e19dbc18b8eaa842825823f2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::sanitize::sanitize_metrics (cognitive 44): overalls_otel_guest_receiver::sanitize::sanitize_metrics has cognitive complexity 44 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 5 (18 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 31). 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":"nix/domains/system/otel-guest/receiver/src/sanitize.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1168c402f6b3bd7a29aae1ec4fa2b432ef5852b9fb2f3893906df616e334562b"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalStream.PollRead (cognitive 43): MilaTerminalStream.PollRead has cognitive complexity 43 (threshold 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":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c5ace205ffdb1297bdc27b4fd1aa92638d549371ecadad5f208c02534b6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Propagation.query (cognitive 43): Propagation.query has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 2 (4 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":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1666437d45e4cfd12ce8e397e6312203fde06050cd8f5254756eb7b93c35093"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_native_admission_after_restart (cognitive 43): scenarios.run_native_admission_after_restart has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 11, loops 4 (5 pts), 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"891f654eb432b58409528ba0be6c3d650b9ba5b8e3c1fb6591573f273fbddd03"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Main (cognitive 42): Program.Main has cognitive complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/Program.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a99b8fd6531bbe4077a022dca093d522c2037ce96c2b89b37ce647a384c5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Backup.execute (cognitive 42): Backup.execute has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 4 (12 pts), boolean chains 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":"lilly/lib/lilly/backup.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5709b6da4a66a8748c62f925ffc725b5d5abf4b60022becf950f367db31d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTemplate.create (cognitive 42): ImageTemplate.create has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 4 (9 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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b90da870ab4d211fb9a89896cf77c56722022367bb5791ede36d9695764cd94"}},{"ruleId":"D2","level":"warning","message":{"text":"assertions.python_calls (cognitive 42): assertions.python_calls has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 2, ternaries 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":"antithesis/verification/assertions.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02221ff9b071815f6b0102394ddbfdecc0bb07e99807041440e9333547f7315"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::pages::build_threads (cognitive 42): mila_native_linux::pages::build_threads has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 5, loops 4, match/switch 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/pages.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5667b75e43714a655c8a76226a1811364d7f2335f97177ddf4dd844cc355e6"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.main (cognitive 41): GuestWitness.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 6 (10 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd37b52b5e0d000dc9869e952b68e0010e79344e14165defceaf081ef02410e9"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaNativeUiKt.MilaNativeRoot (cognitive 41): MilaNativeUiKt.MilaNativeRoot has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 4, match/switch 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b03dc593e9949ebf0fc2aca9a9f02e1147effc8ee99a25d734368e0b718a3"}},{"ruleId":"D2","level":"warning","message":{"text":"control.effect (cognitive 41): control.effect has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 10, ternaries 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":"antithesis/emulation/storage/control.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf9de9f71f70367eb552977252f48c68e42fb8d5fea46147968b0211d50562"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::web_fetch::html_content (cognitive 41): lyra::agent::web_fetch::html_content has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (10 pts), boolean chains 3, loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/agent/web_fetch.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4015d6e06ce1f6f427601f769b222b26a495d76f260c4a3a9200cb9e5a117d27"}},{"ruleId":"D2","level":"warning","message":{"text":"validateAttempts (cognitive 41): validateAttempts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 6, loops 1 (nesting depth added 10). Most of this is not in the body itself: 5 of the 41 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 578, 616, 634). 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1252adfce5055f767f4d5f9b41abcbb3cc78c6e9677a3b67b5e734a9f2ea316b"}},{"ruleId":"D2","level":"warning","message":{"text":"collectUnitErrors (cognitive 41): collectUnitErrors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 7, loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 38 points are the body\u0027s own statements and 3 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7596e58914eb99ffa1d98432ddb8e59a27ecf2032826293ca67740be17779ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_sdk.parse_manifest (cognitive 40): fetch_sdk.parse_manifest has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (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":"nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb333d5c972e37dd0440a1149ddb4009d2ab89e11fb9079f4c71e1ff1e23bc67"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 40): cli.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 3 (6 pts), loops 3 (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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae08ab38c72b31270435f8698611eec8662965a99097067186aa48272e0aebb"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.main (cognitive 40): runtime.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 2 (5 pts), loops 1 (3 pts), boolean chains 2, error handling 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":"nix/domains/system/backups/runtime.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"906712c1d78c225ff7fcefd25d536ad9ee3db3d83e4e642d78e8c950a9cce4bc"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios._physical_pressure (cognitive 39): scenarios._physical_pressure has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 16, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e44c02f93710db2288338219834e649628a8767eb892470fffbf085d19d025e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.load_case (cognitive 39): runtime.load_case has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 12, loops 3 (4 pts), error handling 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":"antithesis/workload/terminal/runtime.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ee4cd69eb7cbf661b4f96f9ea94273addf0dde0926625e0bcaa81c31f6fec4"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_input_probe (cognitive 39): scenarios.run_input_probe has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 6, 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41765f57d6abf784164170807cbeb3bae400d800f159ba48ca585a430644011"}},{"ruleId":"D2","level":"warning","message":{"text":"control_worker.supervise (cognitive 39): control_worker.supervise has cognitive complexity 39 (threshold 15). Drivers by points: error handling 3 (13 pts), if/else 5 (13 pts), boolean chains 6, ternaries 1 (6 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/control_worker.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d0a896f3067d02a5d2e5eb968f9861873cc72c63302d2da649f3bf655d3814"}},{"ruleId":"D2","level":"warning","message":{"text":"common.run (cognitive 39): common.run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (5 pts), error handling 2 (3 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":"nix/domains/system/backups/common.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d815e9deac416fd44fe096ca194ca13d68b8e141d6f20c7a0267b8934b990"}},{"ruleId":"D2","level":"warning","message":{"text":"backup_status.backup_status (cognitive 39): backup_status.backup_status has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 6, error handling 2 (5 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":"nix/domains/system/fleet-exporter/backup_status.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9550ff4dc0780e71c8bf7a8e545ab1e49bc150bd2e04f2a5cf7d19e8886cba5"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot.render (cognitive 39): Snapshot.render has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (10 pts), boolean chains 8, ternaries 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":"nix/domains/system/fleet-exporter/exporter.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c79231a18ad8b14cda4aad70dfedcc34d30221caf886196477e9f6b270be244"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt.admit! (cognitive 38): Prompt.admit! has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 13, match/switch 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":"marshall/lib/marshall/agents/prompt.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7bfd18bea2828855852dc902094c689a25d366bfcf68ea248a8a24e25f288a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceOracle.snapshot (cognitive 38): InferenceOracle.snapshot has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 7, error handling 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":"antithesis/workload/satellite/oracle.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8958bba2d91b2848cf426d600b4a9a782f19a18d88146f241c9aa5e85ec1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"monospace_browser_probe.run (cognitive 38): monospace_browser_probe.run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (6 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":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5b330991d338bbe4754a66b26660fa2c642b2bd9a335f882dfc77bd93c2813"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.capture (cognitive 38): Runner.capture has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (11 pts), error handling 6 (10 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":"nix/domains/system/backups/runtime.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"74332cd95218885b1b0495540ea7c48794a65dc43a088572e489afcb39a03bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::native_growth::gpt::read (cognitive 38): lyra::native_growth::gpt::read has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, loops 3 (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":"lyra/src/native_growth/gpt.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b4424d0a1af4151acd40fc7e05068b466d712ff061dab5ff480966950a36e7"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::views::display_terminal (cognitive 38): mila_native_linux::views::display_terminal has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 7 (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":"mila/native/linux/src/views.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f1856a8f8ba168b57cd919ff2c0da9269fbd55075fe934d9fff218718a6e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.decode (cognitive 37): Config.decode has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 7, 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":"audi/lib/audi/config.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8719d6393f41ab522d6f5682e689e91dd7e8060a7e4b425673d18c871c6bf8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.execute (cognitive 37): Source.execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 3, 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":"lilly/lib/lilly/transfer/source.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c89077c6eee597f168d4919b0c37d09949c2c22c38cc9d7d5682ce90adb08a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelCalls.queue (cognitive 37): ModelCalls.queue has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, match/switch 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":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8356bfb4e1026bd79766b9ea30b937f6aacf1f6fa005e5bafea1b1cbbcfeed68"}},{"ruleId":"D2","level":"warning","message":{"text":"profile_readiness.recorder_host_ready (cognitive 37): profile_readiness.recorder_host_ready has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, error handling 6 (7 pts), loops 3, 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":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8600035590b784e844948323d81edfdb10307bbdf496220b80fa1d712fa57d"}},{"ruleId":"D2","level":"warning","message":{"text":"mila-tailnet-peers.watch (cognitive 37): mila-tailnet-peers.watch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 3 (10 pts), loops 3 (4 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":".github/scripts/mila-tailnet-peers.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490d5038c7c60796271f72c3dd5f37de19190c9c8af043589c111fec30e711d"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.collect (cognitive 37): runtime.collect has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (25 pts), error handling 4 (6 pts), boolean chains 5, 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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3993ba3ce7e21d5ad95bfb1773a7689a018612fd2502550d89b53e734b69c2"}},{"ruleId":"D2","level":"warning","message":{"text":"preflightJsonText (cognitive 37): preflightJsonText has cognitive complexity 37 (threshold 15). Drivers by points: if/else 32 (46 pts), boolean chains 11, ternaries 5 (10 pts), loops 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbd6f450cf9012e79fdb71f88cb00461269205dc00e0440dedc85aa7edcdeb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Pool.device_extent (cognitive 36): Pool.device_extent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (7 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":"lilly/lib/lilly/host/pool.ex"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36f272a011a06ee3b4cf74b79219cd393a03ca6afbb040cc02597a6fecbcf3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.detach (cognitive 36): Network.detach has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 4 (10 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af01399aec2a48f8deaaad88e1709d5572aa61c1ab9c339e8edcc8d99a77868"}},{"ruleId":"D2","level":"warning","message":{"text":"Receiver.pull_disk (cognitive 36): Receiver.pull_disk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (10 pts), boolean chains 5, error handling 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":"lilly/lib/lilly/transfer/receiver.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"af281c80709b1c023ab5ea5cd985cbea5a6c308d5814012b1f651cc041a298cd"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLive.handle_params (cognitive 36): GitLive.handle_params has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (5 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":"marshall/lib/marshall_web/live/git_live.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ce4830f745544c1ad97dd3cd9bd7f153c7702d6de5f0f7805216dd0982f23"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.load (cognitive 36): Config.load has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, boolean chains 9, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/config.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eb03c5f8b896fbc69eb56642a55f4c15d253183f2c0f09ed2bee8b2ff2e17d"}},{"ruleId":"D2","level":"warning","message":{"text":"spool.read_slots (cognitive 36): spool.read_slots has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 8, error handling 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":"antithesis/workload/satellite/spool.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aea2c9769b0e47b05da1a7fdc0a94f82aa6386d8a43a1b2e47739ceb0415867"}},{"ruleId":"D2","level":"warning","message":{"text":"server.dispatch (cognitive 36): server.dispatch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 6, ternaries 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"970d4a484c7dae45be71628ec51444d1606ef83e90459b1b8b4d7267d81771bf"}},{"ruleId":"D2","level":"warning","message":{"text":"campaign.initialize (cognitive 36): campaign.initialize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 9, ternaries 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":"antithesis/verification/campaign.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bed10200c627829e076993e0dec657d36138127b4801bcce322f7b1aa6621af"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_parity.main (cognitive 36): rust_parity.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 6 (9 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"buck/rust_parity.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b83229dfdca090e01ba3f212a51f07e34b6bf562af71ecb525ef882a4b9c95"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::journey::run (cognitive 36): mila_native_linux::journey::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (25 pts), match/switch 4 (6 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, 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f17c53b86faaf985d3fc6268efaae546fd094bf1821ae3ecde4c88c6b3ac9c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorAssetsProbe.check (cognitive 35): EditorAssetsProbe.check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 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":"audi/lib/audi/http/editor_assets_probe.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"285bab68ada8324907aa585605f835b5d9928be4790112d814bd2ce84931a195"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream.chunks (cognitive 35): Stream.chunks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/http/stream.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0418ff4ea00bfcb4c3a9e9cc588e8d4f610aa3fd26ad154f29ceba13ea879193"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.recycle_other (cognitive 35): CheckpointStorage.recycle_other has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 4 (9 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de16cf5866abe38a6b044ecd2dc196c6ab2224dfe0b8afee2f165fc4470b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.reconcile (cognitive 35): Executor.reconcile has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 9 (13 pts) (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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2aa042dbaa486658336ea12c96891d052c5fbd4dfbfa75d9e3b2d5bf81a7969"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestTrust.exchange (cognitive 35): GuestTrust.exchange has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (31 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":"lilly/lib/lilly/vm/guest_trust.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58608226d80e821ca806a3df9748a4abaf255786875d90f96518da21f9f68dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployment.healthy (cognitive 35): Deployment.healthy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (6 pts), boolean chains 4, 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad59c825e7daacbe005f04066a009e46684c901bbf2a63ba22b3eca87450d93"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_ingress_bridge::run::bridge (cognitive 35): lilly_ingress_bridge::run::bridge has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (32 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":"lilly/native/ingress-bridge/src/run.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9963cf529f87a4bf91951a0a0f33d3621baaaa35b51a979c349b062160842819"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::views::build_terminal (cognitive 35): mila_native_linux::views::build_terminal has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 7 (8 pts), loops 4 (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":"mila/native/linux/src/views.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e417b685e78e700aa1c544e3fe0b5e597d39bd2234354a6b7f85d2b963d370f"}},{"ruleId":"D2","level":"warning","message":{"text":"Observed.ready? (cognitive 34): Observed.ready? has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (4 pts), boolean chains 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":"audi/lib/audi/acme/observed.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2378dc0d32bb2daaa102f814add4ecf3bd538435391cca4dd03a2a9170f17a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.load (cognitive 34): Config.load has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20, boolean chains 13, 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":"lilly/lib/lilly/control/config.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"379d797fb8cf7a5fd50b8c469f876211e22623ec7cc8e7a8acf8251825f47873"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointTransfer.prepare (cognitive 34): CheckpointTransfer.prepare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 5 (13 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cd12c6aad8096e8fabf2bc8120e353525ea5f00699f0191ebe32667e6b7435"}},{"ruleId":"D2","level":"warning","message":{"text":"Authority.open_on_vm (cognitive 34): Authority.open_on_vm has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (12 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":"marshall/lib/marshall/terminal/authority.ex"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe79783b2a829c61613d7c4f6eefdb8809b0de98e2f782057b4991769eb79e9"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::update::supervise (cognitive 34): lyra::update::supervise has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (2 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":"lyra/src/update.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"987e7c08ad43600c1e1fef13c6c4ec2f3c6dd0ae2826d9e03376e4b4f76fbbd4"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::gtk_journey::page_steps (cognitive 34): mila_native_linux::gtk_journey::page_steps has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (27 pts), match/switch 4, 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ab322ab5832620b80875619d1af93a536c104e3007505c175e397556d6dafa"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetWorker.fetch_if_due (cognitive 33): FleetWorker.fetch_if_due has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (4 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":"audi/lib/audi/tls/fleet_worker.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaaf917d6e2d1095689eeba7c55778ae09f7025c433f8ed5635396bff089e23"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy.exchange (cognitive 33): Proxy.exchange has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (7 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":"brady/lib/brady/proxy.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe582575ddae34e0d3f9f13c7d174bc17eab9818841059ce80c82645c947a65e"}},{"ruleId":"D2","level":"warning","message":{"text":"Credentials.exchange (cognitive 33): Credentials.exchange has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 pts), boolean chains 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":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9486da69c907d218a80ea715c297802ce99da4e1e69eb30f2dc82f7c1ad010f"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_ring_budget (cognitive 33): scenarios.run_ring_budget has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"850475b0f289f0af48bef54870c61f417937cff7c9c095853d4747fa9c710266"}},{"ruleId":"D2","level":"warning","message":{"text":"selection.selected_files (cognitive 33): selection.selected_files has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 6 (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":"antithesis/verification/selection.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b5da198d01fec6a88222b59291fdab446af5cf98986ce5e8da2969c18a364a"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.prepare (cognitive 33): runtime.prepare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (5 pts), boolean chains 4, error handling 1, ternaries 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":"nix/domains/system/logging/runtime.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2df531ca616b9b48a96d1716caecc9a9b7fd0d47a417421808ad524a0c1b37"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaWatchController.update (cognitive 33): MilaWatchController.update has cognitive complexity 33 (threshold 15). Drivers by points: error handling 4 (12 pts), if/else 5 (8 pts), loops 3 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaWatch.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"12602c06fde90b6ad7d60d200184c85fd14c4fc3529b449d4d0b02643c30ce0e"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_trace_spool::forward (cognitive 33): overalls_trace_spool::forward has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 8, 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abf31c3c6527c10268dbf6b774bfb999baad757ee5e4b60b81055a06906500f"}},{"ruleId":"D2","level":"warning","message":{"text":"Script::guest_tick (cognitive 33): Script::guest_tick has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c0a0b0aa47406a1e5184fed9ecdeaf93ea295738ff3d00b804e2fb0b2d28e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.serve (cognitive 32): Server.serve has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (6 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":"audi/lib/audi/relay/server.ex"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be55bd3d4fb3b7512dd721b7fbab3de757446ec109315a2298c7d49a0980718"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTemplate.with_image (cognitive 32): ImageTemplate.with_image has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 6 (15 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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e096b43c4a7eb1df0bf8623d26cbbc5a64d924808bc0c9854a38cff1abe73f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportJournal.for_intent (cognitive 32): ImportJournal.for_intent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 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":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39770b244f7365f30fb2f674245b56920d9fcb7c609e8d8d9e0b9ca658046ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Flush.request (cognitive 32): Flush.request has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 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":"lilly/lib/lilly/vm/flush.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff46efc4db026d1cf3c207c1aaa102e63459dcc3df57d1ab15c50ec3bf5ea188"}},{"ruleId":"D2","level":"warning","message":{"text":"InceptionExchange.exchange (cognitive 32): InceptionExchange.exchange has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (4 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":"lilly/lib/lilly/vm/inception_exchange.ex"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0621337c610823cb0a5765e1231b7db9387f4173e7a4ac58349bb0a40609230a"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelAttestation.probe (cognitive 32): KernelAttestation.probe has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (4 pts), boolean chains 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":"lilly/lib/lilly/vm/kernel_attestation.ex"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c35a3bc22b5c01c1c472a0c31889090c3dac3ee0cdb4dc18e2d77e49dc7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutorSession.with_attachment_command (cognitive 32): ExecutorSession.with_attachment_command has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 10, match/switch 4 (8 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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d872c8850e1b41efbcffdad4fa8284d96ff11f6d7b156e9481e8b667cff34652"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowServiceLevels.activation_evidence (cognitive 32): WorkflowServiceLevels.activation_evidence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, 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":"marshall/lib/marshall/compute/workflow_service_levels.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e9dfc19c8c07ba2aa12b7b45046ebfd17fe3bb7317298b123d5336649e929d"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.run_magic_preview (cognitive 32): browser.run_magic_preview has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 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":"antithesis/workload/access/browser.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cb6f75a8024dd89cd88c069f5d717ab050cdf3cc185eeb97fe8cb48ea69acb"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.prepare_vm (cognitive 32): runtime.prepare_vm has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 8, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/runtime.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"704af4860f396ca28fa51e65648d8a5e77273697933f9a9c8f04e6b9293bdc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"packaged_instrumentation.parse_instrumentation (cognitive 32): packaged_instrumentation.parse_instrumentation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 4, 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009b8414cf1b0d619272840231adf5aba17192df67f72af5583ddecd3e03bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaRootContent.body (cognitive 32): MilaRootContent.body has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 6, match/switch 3, ternaries 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eff2a3b63563ebf491f6869490af78877cfe830e7b3916becf90c005308086"}},{"ruleId":"D2","level":"warning","message":{"text":"collectDataLimitErrors (cognitive 32): collectDataLimitErrors has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (7 pts), boolean chains 4, ternaries 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2917111e84fcde11ab404b27f86013a03ba3072fa4509dfe70a3d38268a50742"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupSnapshot.cleanup (cognitive 31): BackupSnapshot.cleanup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 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":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"def70493852aa5dab0bf8240e753252766d0b55663c0a63a36036ab214db43c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClonePlacement.reserve! (cognitive 31): ClonePlacement.reserve! has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 11, 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":"marshall/lib/marshall/compute/clone_placement.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f5a1f6caede37509dbc3b3e59b407b12d2a6eabac0f4399ead552d392de57"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_capacity (cognitive 31): scenarios.run_capacity has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 11, loops 3, 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1b1565f127f65311021dbae6c199eb55f9d78f226e53aafb04bd963d9474a0"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_recovery (cognitive 31): scenarios.run_recovery has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, loops 2 (3 pts), 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4543a5772906b45293e4a26082b53464314163757c2a72398582e505ff68d79"}},{"ruleId":"D2","level":"warning","message":{"text":"editor.run_login_code_reply_loss (cognitive 31): editor.run_login_code_reply_loss has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 15, if/else 12, error handling 2, loops 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":"antithesis/workload/satellite/editor.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"39175bc3913db3979a9d481e6eb9251d2fd73eebfa1f958b29178ff083e50596"}},{"ruleId":"D2","level":"warning","message":{"text":"storage.prepare (cognitive 31): storage.prepare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/storage.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9321ffcf4eae8c8df5540e988859aca3cadd8aa376c38840bfed126279c9375"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::handle (cognitive 31): Session::handle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 6 (11 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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0545547350f0b9675a73505b12a56dcdb7e8d8b9001fa582c1ce1318e58ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"Effects.run (cognitive 30): Effects.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (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":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a16a00727d5b7d5fdf1fb86a964fdd86c4706cbdb662eca1a6f972d7e1d0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneCopy.copy (cognitive 30): CloneCopy.copy has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (9 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":"lilly/lib/lilly/transfer/clone_copy.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a9c259518de177ea51039ff2a555a8727ad1e7674de9b0d44b57fe535d365"}},{"ruleId":"D2","level":"warning","message":{"text":"Key.ensure (cognitive 30): Key.ensure has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (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":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"188e0ceef336c87134e44f2e41016d0b6d26ff8ba6a03958a9e0b0764e00fffb"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.prepare_slot (cognitive 30): CheckpointStorage.prepare_slot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 5 (9 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57de1d295d73b8e635ec27f19afbf42b39e4fc5c11cf810cb04123806975ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"EvacuationViews.inspect_node (cognitive 30): EvacuationViews.inspect_node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 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":"marshall/lib/marshall/compute/evacuation_views.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"132c3594711af58aff5004d861ddb845fc07df94f684c1c93c247a8d6f0b7532"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.run_legacy_request (cognitive 30): dispatch.run_legacy_request has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 13, 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":"antithesis/workload/control/dispatch.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9770a9bfb884d2b4aa308040d31768c498d14188e3abfe3c5bbbde0495da155"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_kill_under_input_stall (cognitive 30): scenarios.run_kill_under_input_stall has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 5, loops 2, 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb81a8b1c3d03b41016bb13e39d3d67b0e17d2fe41b74f803514e0f032df98"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeState::ensure_window (cognitive 30): NativeState::ensure_window has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (7 pts), loops 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":"mila/native/linux/src/main.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b2a99c6124a9c20c2f4ea96ce40ef5dc5983cd695e201e5c1e7e5e20633109"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::journey::run_pages (cognitive 30): mila_native_linux::journey::run_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 7, loops 3 (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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6936734b82d1e7254ebabf43b48c93703736f7b3aabb200b9dcbea8c0aac3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::parse (cognitive 30): Command::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, match/switch 1 (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":"mila/rust/mila-protocol/src/command.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dabedf3abf611583a3e0f5ebce9b31f19b52659ba8f4d7c2d12663f2489c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::windows::files::descriptor_acl (cognitive 30): overalls_vscode_web_broker::windows::files::descriptor_acl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 10, 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":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a6f062c1cd854444a1485b5757cdd29ecd834d29e53f3640643644c72f411c"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalView.Render (cognitive 29): MilaTerminalView.Render has cognitive complexity 29 (threshold 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":"mila/windows-dotnet/MilaTerminalView.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b941daeffc6c8dc98d9916081868a5df2a0860549f5e42b4e03917ecd43752bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTemplate.reserve (cognitive 29): ImageTemplate.reserve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"491841fb709d597cdb36f07014d54a373a94b40f86e355673e42c4bc485f897d"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.valid_transition? (cognitive 29): Checkpoint.valid_transition? has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 27, if/else 1, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/lifecycle/checkpoint.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9402fcb7b8b8648061b92fdf56bf1b441a10657876a875d784de698ab92bc879"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.maybe_deliver_trust (cognitive 29): Driver.maybe_deliver_trust has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (12 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba4ceee5007210aff3d7b8f001cc4f047eb51b1f286649f14ffba30744d697"}},{"ruleId":"D2","level":"warning","message":{"text":"Readiness.probe (cognitive 29): Readiness.probe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (4 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":"lilly/lib/lilly/vm/readiness.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8207c3de5b6b1c66d375ae1056916eacbc98c4b8c245d7c8835b15c54496629c"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationCapacity.prepare! (cognitive 29): RelocationCapacity.prepare! has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 14, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_capacity.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f04266539d635465d007ad9408a74e26bed2a6381d31ce5542cfe9e4ebfd28"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationCoordinator.stop_confirmed? (cognitive 29): RelocationCoordinator.stop_confirmed? has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 20, if/else 8, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc86ebe06e9e80f91b5682f80d4ae5c3867cc0e3f905416fae1db519082b300"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.probe (cognitive 29): bootstrap.probe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 11, loops 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":"antithesis/workload/core/bootstrap.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0039f0d697e5901c0a711ffda16c06ffcafdb3b8ac464a5d5e53fb686ec2fdca"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.walk_inputs (cognitive 29): identity.walk_inputs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (8 pts), boolean chains 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":"antithesis/verification/identity.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b84a292d676f394596ce78ee847e1f2a0ea68d1437653739d309e273e085db"}},{"ruleId":"D2","level":"warning","message":{"text":"packaged_instrumentation.run_suite (cognitive 29): packaged_instrumentation.run_suite has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"231cff284e4c22e231785c11a47f18985942c70e737a429879858e37717f3e55"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validate (cognitive 29): cli.validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, loops 1, ternaries 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":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0dba4b423982ec12d4ba5fc3b8476369b3bd3fbc7bbecebeff79c9f3ac3e34"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::handle (cognitive 29): overalls_otel_guest_receiver::handle has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (21 pts), if/else 4 (8 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":"nix/domains/system/otel-guest/receiver/src/main.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6a791254cb1859fbecc64b081ac78dc14c87cb0277c7a4bce17ba1c16f879e"}},{"ruleId":"D2","level":"warning","message":{"text":"enforceJsonTextLimits (cognitive 29): enforceJsonTextLimits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 10). Of this number, 26 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08c06454a261729c4688251b47170a52c9f50b5cfa862ab2211283114eb0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.import_claim (cognitive 28): ZFSDataset.import_claim has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bcf01a0b1470114e381ec9af8fbe9a2e3175040ed9ff3a85d83af7206dd7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.current! (cognitive 28): Execution.current! has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 20, if/else 7 (8 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":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112fa71c779c72b6e8fe85641c92b0bff113b5928ea4012ef66273468fcdc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Publications.snapshot! (cognitive 28): Publications.snapshot! has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 10, 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":"marshall/lib/marshall/ingress/publications.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f837f48edf3640e4226a23808f7d2e94d3f2864c8f286ef7dfa5a93b3350cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadsLive.load (cognitive 28): ThreadsLive.load has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 13, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6567e2cd3da028e9b091da41d579732a992d22ae70ad3dbb3527744f861f7d63"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeOperator._call (cognitive 28): ComputeOperator._call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 3 (5 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":"antithesis/workload/admission/client.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e723bf10e4d950fa6f360e36a89fc8a700951459e0d70885fbe0ede8250f0763"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_credential_revalidation (cognitive 28): scenarios.run_credential_revalidation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 10 (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":"antithesis/workload/control/scenarios.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e21580968a30331b3de9e03930ac9dc7eccff6979d7ee9b0ebebdba8eacc2"}},{"ruleId":"D2","level":"warning","message":{"text":"SatelliteOrigin.receipts_after (cognitive 28): SatelliteOrigin.receipts_after has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, 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":"antithesis/workload/satellite/origin.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2abb704fee12dd0954c4ef257dcae6de994d67dde0d044a4553301926167f"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_completion (cognitive 28): scenarios.run_completion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, 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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1284a0af2c3d45ca27a86a26a3c96a6eb68a620e17d3a2ecd47f68818f45847"}},{"ruleId":"D2","level":"warning","message":{"text":"campaign.reserve (cognitive 28): campaign.reserve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/verification/campaign.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7383e482ab49d6d22a58afc65efaaefe533d19610a1196095961067f836e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.docker_copies (cognitive 28): identity.docker_copies has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, ternaries 1 (3 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":"antithesis/verification/identity.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4540e038ec031c689fbd9408e97c8be6a63396b51675c15b152b6cedf8cb4bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_trace_spool::request (cognitive 28): overalls_trace_spool::request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 3, 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab28805511276e8e4eccd3fcaf120523b3fc0ccc1360fff18a767a6c2b436a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::bin::overalls-host-certificate-windows::agent::run (cognitive 28): lyra::bin::overalls-host-certificate-windows::agent::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45563b04e587333b96790a9f469d1630dec2e1fbd0c7a3806f94b7fa099f38d"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy.deliver (cognitive 27): Proxy.deliver has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (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":"brady/lib/brady/proxy.ex"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"159d160d0ec5a5664d78906effd22aac9f79862912f9da2a0e565fc11010298b"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointTransfer.received_native (cognitive 27): CheckpointTransfer.received_native has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 8, 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fcbfd3fc0d99b07c3a76c4350dbd06ed9f014ae63fb53ee768d8b311ce4b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"PermitJournal.mutate (cognitive 27): PermitJournal.mutate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5004f523d895fa7c88664731df9e00f6c3170d570bf240b573edf071e93225d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.native (cognitive 27): CheckpointStorage.native has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, boolean chains 9, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937bf9071718c0df0b97b3791623c8788df74187d14d5f5ad1162fbbf4a560f"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.launch (cognitive 27): Driver.launch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (9 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"80712f82d211a476189d7c99b618fe780532620741827b618d1019bdeed00ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.begin_launch (cognitive 27): Driver.begin_launch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc59f9eb389f60e224a1b4a7db1e6d0c555dd9da20e0ab826747a49c501615e"}},{"ruleId":"D2","level":"warning","message":{"text":"Intent.set (cognitive 27): Intent.set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (9 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":"lilly/lib/lilly/vm/intent.ex"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3831207bf926d0bd2990e1f2e72a5d31b4fad0bd53cde4708f438348a600724"}},{"ruleId":"D2","level":"warning","message":{"text":"Administrators.run (cognitive 27): Administrators.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 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":"marshall/lib/marshall/accounts/administrators.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"57311baaaf3bcd66b7eb6200792a0ffcf61f567c5559b7da8d35490002e3c990"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationReadinessState.activation (cognitive 27): RelocationReadinessState.activation has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 20, if/else 6, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_readiness_state.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1382d97bae0ed5906dddd8da9cebacf0b64c9c4f9cba6cd99d532905bc3a79c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Wake.request_locked! (cognitive 27): Wake.request_locked! has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, match/switch 3 (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":"marshall/lib/marshall/compute/wake.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b385d1a8af57318c9f1e38789e16ebdb92cfa318a2e90b458e79a5c170229b"}},{"ruleId":"D2","level":"warning","message":{"text":"observer.read_snapshot (cognitive 27): observer.read_snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 8, error handling 2 (3 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":"antithesis/workload/repository/observer.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"55000d50979df72c25e1ca1117d4528b3bc0b84184b048cf1ad12a3b526e5c16"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_replay_cap (cognitive 27): scenarios.run_replay_cap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d49a59e99e99c25664d75e1199baa2d4411ce94ceff43f16271285b0c7c907"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_neighbor_progress (cognitive 27): scenarios.run_neighbor_progress has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, ternaries 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc78391c867a1e512a22d49561131dad85dc186e9d864fceba64ba9376ef04a"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.stop (cognitive 27): runner.stop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, 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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf32c4c0dff11770ab28d970d74439a842a871f9bf21992bb23e8def6c47f5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"affected.select (cognitive 27): affected.select has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 6, 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":"buck/affected.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"12596326b872d603dd38dabe46a87a3bab84d4092625a9c4a4a0130811d0978c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_assembly.check (cognitive 27): check_assembly.check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 5, 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":"nix/domains/artifacts/guest/omnios/check_assembly.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f4970546b5d8ff69bb2ad0c0de50c967d55862cbbcd78573fd4d1af9fe8856"}},{"ruleId":"D2","level":"warning","message":{"text":"Transition.prepare (cognitive 27): Transition.prepare has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eab22c46cc43f5c461fb0a34c05b9807e0ebbecf9a2e2728ba690c530ef6fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.device_metrics (cognitive 27): metrics.device_metrics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 5, 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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1813703bb3bf45130511350937e1cf3a203cebc16a015cf5228308d9820bd02"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::run (cognitive 27): lilly_hostd::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (4 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":"lilly/native/hostd/src/main.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94647e7bcaccb9c39c75ba0d1876e8f8670fb416a66274500cca71c0cf678dd"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::bin::overalls-ssh-sync-windows::sync::run (cognitive 27): lyra::bin::overalls-ssh-sync-windows::sync::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (10 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":"lyra/src/bin/overalls-ssh-sync-windows.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd540bfa2a9f0b60cb02cf092dcfcaf1baecd67693e21bae39c3c06b189092"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalScreen::feed (cognitive 27): TerminalScreen::feed has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 5 (9 pts), loops 1 (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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1bd720ac5499b953fe8fa69376504b6c51de7c12f3ffbfc3b2af51d216449d"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalScreen::csi (cognitive 27): TerminalScreen::csi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0524567b9c461e861caa6b1270cc7c98ac43f2e3fa80f7b500efc0410de9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"validateDocument (cognitive 27): validateDocument has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, ternaries 2 (5 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a889806014a3859d5fe3215f20b9c1b40bdacf0a8a54be4776f05d0266353"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.current_replay_binding (cognitive 26): GuestWitness.current_replay_binding has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"752a9e3752341ff2293413681a30b83c4859f9e654ae567dd9af9fb2fb64faee"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.publish_exclusive_arm (cognitive 26): GuestWitness.publish_exclusive_arm has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (6 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ce2eee5e538e8936103e0eccb1b2b255240f6dd7c96054025a8730aa94d8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Front.forward (cognitive 26): Front.forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 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":"audi/lib/audi/private/front.ex"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"232b4e42172d88c8289c9ea7ec0a3e8d4d582b4b86ae1b6867f49c07cdc285c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Head.parse (cognitive 26): Head.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 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":"brady/lib/brady/http/head.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"29197210d441cc7c77a1ab8781a3633fb6b2070982b5242a750570bfe9f8a9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy.forward (cognitive 26): Proxy.forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (4 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":"brady/lib/brady/proxy.ex"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfcb063c65a943188aa657f2dd57bd8e0bf3947ce00ddc1822b14eb6d5e446e"}},{"ruleId":"D2","level":"warning","message":{"text":"Effects.stream_disk (cognitive 26): Effects.stream_disk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (8 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":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"61485ec99df53a1a4eb3663b639805795e0c7f00a72eb9881f4acee89ed2b2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.claim_files (cognitive 26): CheckpointStorage.claim_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c8b2de2dac0e4663250c53ba9737609c83ff8f209fe716ae2f0f44f45d4c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceSource.connect (cognitive 26): WorkspaceSource.connect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (4 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":"lilly/lib/lilly/vm/workspace_source.ex"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aedf0f1e7ff2eec22b595addaf0b0ff702d68a2d7ca2ae9ad0a04e3c3a94b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationDeletion.advance_locked! (cognitive 26): RelocationDeletion.advance_locked! has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 11, 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":"marshall/lib/marshall/compute/relocation_deletion.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade6afd23ee90f48eb5496dc2c9f80d689f34b53dc029bc8c6582fee45d38541"}},{"ruleId":"D2","level":"warning","message":{"text":"OverallsProtocol.pool (cognitive 26): OverallsProtocol.pool has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (9 pts), match/switch 2 (5 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":"protocol/lib/overalls_protocol.ex"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfb3f16dc8573e172daba29b8c40eac600d013e5c6e3ded24af7033a2e12f31"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalRenderer.append (cognitive 26): MilaTerminalRenderer.append has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineControls.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b44e1747cdc2b5a4f6215cd1bc2204239ddb0a9cf90593438b7c55757e79dd"}},{"ruleId":"D2","level":"warning","message":{"text":"statemachine.execute_state_machine (cognitive 26): statemachine.execute_state_machine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 9 (13 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":"nix/verification/hegel/python/hegel/statemachine.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6acc595a4d0cec15bc143d9248886786a9c9e066512a5caa11b771789498b13"}},{"ruleId":"D2","level":"warning","message":{"text":"packaged_instrumentation.journey_run (cognitive 26): packaged_instrumentation.journey_run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (4 pts), loops 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bcc60ed5962320e2f31fc80e5fc29d8960758721b6c0a80841f9fd486905a5"}},{"ruleId":"D2","level":"warning","message":{"text":"public_settings.validate (cognitive 26): public_settings.validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, loops 2, error handling 1, 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":"nix/domains/artifacts/guest/inception/public_settings.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27a45de67d6c6d1f0c9bb0b7d5cd0e5c79eae00bf16ed67701e5cef31f28f0"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_runtime.prune_illumos (cognitive 26): verify_runtime.prune_illumos has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (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":"nix/domains/artifacts/guest/native_git/verify_runtime.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9719db105a6ee7b782018400521cf7e1a090683a703525e1910b73d3dc19e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployment.activate (cognitive 26): Deployment.activate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, error handling 2 (4 pts), 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87699cf85ef96c148c0c13fe6714979939459e4404e5f0dc567241d793a6317"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployment.stop_units (cognitive 26): Deployment.stop_units 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658d0043bdb2dcdf1f041215dd78bbf5474c7086752254dd3c721253df269a6"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCapture.prepare (cognitive 26): HostCapture.prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, loops 3, ternaries 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":"nix/domains/system/backups/host.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56978df7d82e9f676656b9811f711219f3c249fdae4dbda7c036533f97992b71"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalController.startReceiving (cognitive 26): MilaTerminalController.startReceiving has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, loops 1 (2 pts), error handling 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":"mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ab1775f0a4b317616b499c798f39f8250753f7af4ec832d2a4da368ae6fec4"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalFrame.attributed (cognitive 26): MilaTerminalFrame.attributed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 3 (9 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":"mila/native/apple/Sources/MilaNativeUI/MilaTerminalFrame.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bca7f29b79265ab2cb3ccc5202860ae7406ba18504e7cd409299ad734c7d0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::nft_policy::host_rules (cognitive 26): lilly_hostd::nft_policy::host_rules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (10 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":"lilly/native/hostd/src/nft_policy.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cd878d3d902806459a9e02f3bca82e006b5aad80b6bf3b837696a595b9a945"}},{"ruleId":"D2","level":"warning","message":{"text":"JourneyDescriptor::parse (cognitive 26): JourneyDescriptor::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, boolean chains 10. 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"04701df31d6767b6a4be3f2da5027a46c1c9d664722810e13dfde202cccb2e55"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalScreen::sgr (cognitive 26): TerminalScreen::sgr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"412bf9aedc6e9d7e1a325a22354bddbde5e957914b9b72e7d4dfdf94bc54529b"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_terminald::control_message (cognitive 26): lilly_terminald::control_message has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 12 (24 pts), loops 1 (2 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":"nix/domains/artifacts/terminald/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4abb436200aba6f27b3dd2e9865306406293ea0937a0e4a39c3aa343fd4068"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::mmds::response_head (cognitive 26): overalls_vscode_web_broker::mmds::response_head has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, 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":"nix/domains/artifacts/vscode-web-broker/src/mmds.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eef5360076338107c5936833897be6675aeaa7da47ee7820c3f4944ebb998a"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::slo::run_with_custody (cognitive 26): overalls_otel_guest_receiver::slo::run_with_custody has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 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":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c47324cb50c33c7bbb1d05ca6d05e3814926ec77c00df2a2d37eb3e28f935b"}},{"ruleId":"D2","level":"warning","message":{"text":"Front.call_traced (cognitive 25): Front.call_traced has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (11 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":"audi/lib/audi/http/front.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8a02bf2a3d3dbe69ca8d7237add310c8d36cfd9815e99f16c092470e201e71"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFS.vdev (cognitive 25): ZFS.vdev has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (10 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"629f345893402becc4ff9260624ef17b0d9e17cfc03653770145ebca53014f41"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.resize (cognitive 25): ZFSDataset.resize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, match/switch 2 (3 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"290895c845de2c73e835a3490acf4174a987a30b773b88d3fde782f84d083789"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointTransfer.pull_memory (cognitive 25): CheckpointTransfer.pull_memory has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d877daa28517fe700b2f937e38364cb5f2dfe8414ba8780823213d146ee7942"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportCleanup.cleanup_intent (cognitive 25): ImportCleanup.cleanup_intent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 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":"lilly/lib/lilly/transfer/import_cleanup.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3202d2feefa5ddcdc4a031232675c47cd54f287f1292a548ffd14288cb4658"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportCleanup.destroy (cognitive 25): ImportCleanup.destroy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 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":"lilly/lib/lilly/transfer/import_cleanup.ex"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a5ce7a4b8c99d1e7a285fa25d0a1a51f4ff38cd104786bc9081aa0d5403a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCleanup.snapshots (cognitive 25): SourceCleanup.snapshots has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, 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":"lilly/lib/lilly/transfer/source_cleanup.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d752f9612e12029a890c4b1733a41c6fde5560cebb919eec6b2c80d13ca39b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.new (cognitive 25): Config.new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 5, 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":"lilly/lib/lilly/vm/config.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d543e5da8f57ed55b36589e563535091e975937cfc67715971252c438a687cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Disk.materialize (cognitive 25): Disk.materialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/disk.ex"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a8946c4e4f73ec1c19e23c93a0b1b0957c04699baa4db0847df1b2642b2a52"}},{"ruleId":"D2","level":"warning","message":{"text":"Evacuations.advance (cognitive 25): Evacuations.advance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, match/switch 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/evacuations.ex"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c178106e3fa014f0ce909f2fe3427e4d7bd2a1d8a114617c44c21ba3db53ec"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationReadiness.accept! (cognitive 25): RelocationReadiness.accept! has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, 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":"marshall/lib/marshall/compute/relocation_readiness.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"99619ca350fcf372cb03896d4df7836a647f8d068af80cb0711b81ccc6dab86c"}},{"ruleId":"D2","level":"warning","message":{"text":"Sharing.set (cognitive 25): Sharing.set has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (9 pts), match/switch 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":"marshall/lib/marshall/terminal/sharing.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"933bd7d3f559b3a2417cccfe4ff9adfa5c894a5d1f2abff27e76a579b9d8bcc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.load (cognitive 25): Config.load has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (21 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":"porsche/lib/porsche/config.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4665c3674a5a2824e9e9da0845b67e973a4d43f02ae661e2c1d669e70a4d735"}},{"ruleId":"D2","level":"warning","message":{"text":"SSHHostCertificate.parse (cognitive 25): SSHHostCertificate.parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 23, 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":"protocol/lib/overalls_protocol/ssh_host_certificate.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20b38664921b5a415039d11c786867bce06f21b490ea937a266ee5cbb5c130"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalFrame.annotated (cognitive 25): MilaTerminalFrame.annotated 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaTerminalFrame.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d932d45f7c1f5a2811a827de4527e2e87475edfd578f4c0cc551f4fba2a5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.run_remembered_revocation (cognitive 25): browser.run_remembered_revocation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, 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":"antithesis/workload/access/browser.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19302f6b23d69377b47e815cd43685cf099ce17480fd04c984f494e6a369ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.verify_image_selection (cognitive 25): identity.verify_image_selection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (6 pts), boolean chains 3, 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":"antithesis/verification/identity.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d8af4f935496f6f2d8c8b37b6b50e4101b6f6e3a1fe9c5972280d23b8b6ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::parse_options (cognitive 25): lilly_hostd::parse_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 8, match/switch 3 (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":"lilly/native/hostd/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"29385062629dfbce2b0d990bb815c9133c71dd482414b20445dbdf6a81cc8ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::managed_skills::git::scratch_within_limit (cognitive 25): lyra::agent::managed_skills::git::scratch_within_limit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 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":"lyra/src/agent/managed_skills/git.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7666efd5950edb1b6671339a722cd633546e0685f5145e714f17f90ad5e542e7"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::workspace_checkout::resolve (cognitive 25): lyra::workspace_checkout::resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (8 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":"lyra/src/workspace_checkout.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c3556e32881a7718d8aaac47691355c3e0ba98d25169a86885632e4baea461"}},{"ruleId":"D2","level":"warning","message":{"text":"PtyTextDecoder::decode (cognitive 25): PtyTextDecoder::decode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (10 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":"mila/native/linux/src/terminal_text.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3f99a95197b3f4545793c6833e6bbd62e315e3699c037e2383bc03112217d7"}},{"ruleId":"D2","level":"warning","message":{"text":"parseRunRow (cognitive 25): parseRunRow has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 21, ternaries 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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f71af3f4c4b8903135b7eb12fa7b88c60c84a6528de941190dfde40039fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"Headers.request (cognitive 24): Headers.request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 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":"audi/lib/audi/http/headers.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30a5224ef9240417a935687302819c9129b13f7de199205d63e0c61fd176c84"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy.forward (cognitive 24): Proxy.forward has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (8 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":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6296262de2132e21b885faf28e6a6403992e62be446b470ecd3bfac00d54c491"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.handle_call (cognitive 24): Store.handle_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (20 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":"brady/lib/brady/cache/store.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1793c913928079903a7746e81311c3e7807e1860d8ca69e00d406d059dea9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.read (cognitive 24): Store.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (5 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":"lilly/lib/lilly/control/store.ex"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"013a12e3a9316101b24695a2e83338cdc76f7a98bdf53e41e19cf5ff724c4689"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.load_cached (cognitive 24): Image.load_cached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (8 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":"lilly/lib/lilly/host/image.ex"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac20ca72a9b311269c4b78f9cdaf1c15504bfbb30d0a74147c731985c119914d"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.serve_bound (cognitive 24): Server.serve_bound has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 2 (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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d9e59b876fb52eacc5892ba299724680713a185d82858dc7337e603c7a520f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceivedDataset.prepare_native (cognitive 24): ReceivedDataset.prepare_native has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (8 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35df97938de22dab9a2749b3507a401c41b1d39ea7f5ab3b1c6c72f3d72ac3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceExport.register (cognitive 24): SourceExport.register has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/source_export.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"231a47508fe4075fa1722ebc89233ad4bd8ce5f0ad4034ab3da3b353c74ebfd0"}},{"ruleId":"D2","level":"warning","message":{"text":"BootLog.read_inode (cognitive 24): BootLog.read_inode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/boot_log.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"17472fe69170015bcf4decaa8c690a388fdef052200a4a7017e16254aad0be64"}},{"ruleId":"D2","level":"warning","message":{"text":"AttachmentTool.resolve_download_locked (cognitive 24): AttachmentTool.resolve_download_locked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, match/switch 2 (3 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":"marshall/lib/marshall/agents/attachment_tool.ex"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f9d3cabea2d57c03ef234646178ae4c188c90b888b193f99262ea9a7571bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Maintenance.transition_locked! (cognitive 24): Maintenance.transition_locked! has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, 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":"marshall/lib/marshall/agents/maintenance.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c69f11d103df1c04b5c2ae020403dfc13d03bf735f96485cba1471efffdba44"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.file (cognitive 24): Tool.file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 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":"marshall/lib/marshall/artifacts/tool.ex"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d040ca08ff69d7ee10be54b4cadbf30404b43bfaa8f4982f29d1d825c1e479"}},{"ruleId":"D2","level":"warning","message":{"text":"Outcomes.apply! (cognitive 24): Outcomes.apply! has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (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":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3f5f4bcbabf7611632232191f4f487720dd1174b48483569637b9fffaeeb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceLevels.ready_at (cognitive 24): ServiceLevels.ready_at has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, if/else 3, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f84df4b6d6bb0f7b2e81fd666f7f11644433a941f658e685131754fbba9bf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupHolds.settle_locked! (cognitive 24): StartupHolds.settle_locked! has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 19, if/else 4, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/startup_holds.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a961442463982b9ef2eca49d3b666406aee8d85324d7babe38f2b66f9ed91ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneControl.command (cognitive 24): CloneControl.command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, 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":"protocol/lib/overalls_protocol/clone_control.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"981e8be415d09b2e8697bf6ca1eb25f5b5ddc414759bd39aa4396ccd6689bd5a"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedStream.response (cognitive 24): NestedStream.response has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 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":"protocol/lib/overalls_protocol/nested_stream.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc80c31c44ce652b97c7c18789c9cf9467c3483c76b017a8420e8a5758aa47c"}},{"ruleId":"D2","level":"warning","message":{"text":"envelope.decode (cognitive 24): envelope.decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 10, error handling 1, 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":"antithesis/workload/control/envelope.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4357e3c2be2a75a8d2f0371060733bbd0192d33fdc57669815fc6184f04f357"}},{"ruleId":"D2","level":"warning","message":{"text":"guest._snapshot (cognitive 24): guest._snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, 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":"antithesis/workload/terminal/guest.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e77ba6b8295e7ff7fcfbe1c6611fb9c0444c28ac47e287c457e1086f3505f92"}},{"ruleId":"D2","level":"warning","message":{"text":"campaign.modify (cognitive 24): campaign.modify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, 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":"antithesis/verification/campaign.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e5a386556391ef05c43546b47265009e209a8dff9732ca83254ef2e09edd8"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 24): cli.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 2 (3 pts), loops 2 (3 pts), ternaries 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":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23d6abcd7d1b72fca3f7743cdf35a0f5d265fd321344b46b8872b3d7849b3db"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.main (cognitive 24): runtime.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 4 (5 pts), loops 3 (5 pts), boolean chains 2, 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"47129ea842e5251fd9da6a1bae71a12a1609fd91801ce5162c34760008767e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaApprovalDecoder.decode (cognitive 24): MilaApprovalDecoder.decode has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (8 pts), match/switch 2 (3 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":"mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13b2a3fe6f390d7ed6a2ad4edd333dc16a62e6fc4750a29757a38414932ac96"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::open (cognitive 24): Store::open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/store.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3fc035d6353240ce984cfe13f91b424bfcd8f914cad2d32a7f2cde347076c"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::managed_skills::materialize::directory_digest (cognitive 24): lyra::agent::managed_skills::materialize::directory_digest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 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":"lyra/src/agent/managed_skills/materialize.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"273bcf6e438b8a040990a986221f3d86eae57ab298cb2f103ce2f76bf4d340ea"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::native_growth::command (cognitive 24): lyra::native_growth::command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 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":"lyra/src/native_growth.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc74110e19d5a0cce7ae89570c1b6eed87f7c83ad8b4bb8701c130882e7cd49"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchChannel::read_within (cognitive 24): WatchChannel::read_within has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 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":"mila/rust/mila-transport/src/watch_channel.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"85712c63a4364f274f76b6da2e2badd7ee96902036d523db3e4301a10bfb71b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.open (cognitive 23): Client.open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 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":"audi/lib/audi/relay/client.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d00cb57df1fbef723575e3230dd3cc4f2586b7fd6347e9a74e3d8d73233f46a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.handle_call (cognitive 23): Store.handle_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (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":"brady/lib/brady/cache/store.ex"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dce2024f01c43e589d6f0d0725481dfc681c5d1c57598f1581f2521f8a7f001"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.new (cognitive 23): Client.new has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 9, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15cbd02b106fc472954ed16bc50491abf60ab48a31ae8ad08fcb31779eae4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.finish_import_cleanup (cognitive 23): ZFSDataset.finish_import_cleanup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e818a667d21e041bce59e5d115c39ad17fcd300e94309c8fecaceaf7fd9d1b89"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSnapshotCleanup.authorized (cognitive 23): SourceSnapshotCleanup.authorized has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 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":"lilly/lib/lilly/transfer/source_snapshot_cleanup.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9429346296659c776408f953dfdf9beb3bd1da62a56678cd2ada1e9055ee6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Boot.continuation (cognitive 23): Boot.continuation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (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":"lilly/lib/lilly/vm/boot.ex"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7431b976b81fa94b9e4aa19d96905943c9a56c7ec5f4f3f1ac017bd135b36a26"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.begin_workspace_source (cognitive 23): Driver.begin_workspace_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"274c74c36e2c8631b3a5e6f15de4fb08a4069ca646013b51279c42aea55f50e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrap.claim_locked! (cognitive 23): Bootstrap.claim_locked! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"marshall/lib/marshall/agents/bootstrap.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628488257c5927f12e42ea42adb32b63211e1f761cefbc2690aad0cd1d92c91"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadDelivery.register (cognitive 23): ThreadDelivery.register has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, match/switch 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":"marshall/lib/marshall/agents/thread_delivery.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b5258ce802bf1b00604d902ab5bfbe8f2db687661f3b2f1e96006502d3b822"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadToolDispatch.claim_candidate (cognitive 23): ThreadToolDispatch.claim_candidate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, 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":"marshall/lib/marshall/agents/thread_tool_dispatch.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"13223d735b29d754b53cef87f8e1c060be5816fa75e24fb3b4bf03b56ca982ab"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneEffects.accept! (cognitive 23): CloneEffects.accept! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, 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":"marshall/lib/marshall/compute/clone_effects.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7d84c9b12805286a69a12ff94e5d635b363201157fbab61685f8b7241687a5"}},{"ruleId":"D2","level":"warning","message":{"text":"RestartCapacity.check_source_restoration (cognitive 23): RestartCapacity.check_source_restoration has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 21, 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":"marshall/lib/marshall/compute/restart_capacity.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5e34f98b0958f99acdc4b8f5f1bc344d7d95f8567526a75232733805ce78fe"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHub.stage_refresh (cognitive 23): GitHub.stage_refresh has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 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":"marshall/lib/marshall/github.ex"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d50d4371f4d8062d3972e4fc271a41cd45983cdf48bc5a52ad3009ac9edd2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"InceptionControl.offer (cognitive 23): InceptionControl.offer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, 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":"protocol/lib/overalls_protocol/inception_control.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0cfd63174b8da04e6befccac1f81d2c58efcf757d52f68cb75b7df5c76b667"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch._negative (cognitive 23): dispatch._negative has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, ternaries 1 (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":"antithesis/workload/control/dispatch.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eeaadc177303abf404f73ba7edb8fe8b712cb04de4eb03c72b562a217f6871"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalOracle.create_history (cognitive 23): TerminalOracle.create_history has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/terminal/oracle.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cd3fc355b4af7c86e599400896d45f566f6c5a118a6ebfbe6fb0b41247b7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.context_record (cognitive 23): identity.context_record has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, 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":"antithesis/verification/identity.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"341344abe1b7f6dabbc4bdd54864b91a754e431d23b291ffeeaf96384eb00d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.prepare_source (cognitive 23): prepare.prepare_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), error handling 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":"nix/domains/artifacts/guest/inception/prepare.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"93536863613d7e76e134b9244c39b84fe8a81d11fa53c9e1044aac8f10950b80"}},{"ruleId":"D2","level":"warning","message":{"text":"native_candidate.install (cognitive 23): native_candidate.install has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5, boolean chains 4, 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb3288a7bac71ea41a5b6d51c77964c512021d7e64e02d8f806a449e53d3af"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.main (cognitive 23): runtime.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 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":"nix/domains/system/crash-dumps/runtime.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dc0833dc63ae159046b4de7a773e712ad5fc831c01494744d0e54f159f648d"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaSignInController.poll (cognitive 23): MilaSignInController.poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 3 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaApproval.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4fe62ac6307e27f7eb9e3c510038a26eedc5cb8ad2abd4a26d18b9a1584209"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_trace_spool::run (cognitive 23): overalls_trace_spool::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), boolean chains 5, 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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e84e01bf38697a7bde4380f823d8c6dc7e06c3868178e331b97c3ea2489371"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchChannel::decode (cognitive 23): WatchChannel::decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"mila/rust/mila-transport/src/watch_channel.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a9f8ab9df9ddfab40c8471b3a3953ea0ee82ec2f0f9cbd7ff161036c3421f6"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::request_recorder::run (cognitive 23): overalls_otel_guest_receiver::request_recorder::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 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":"nix/domains/system/otel-guest/receiver/src/request_recorder.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd0c11b606cb544ecc2f77ac23c40b4a3e050f557903dceb136e78b80a1a077"}},{"ruleId":"D2","level":"warning","message":{"text":"mounted::verify (cognitive 23): mounted::verify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (6 pts), boolean chains 4, error handling 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":"marshall/assets/js/admin_elevation.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"85080b96dae8f16194e5b22a0d0aea5c10ef115fc45b246854a48d487f11ebb0"}},{"ruleId":"D2","level":"warning","message":{"text":"mounted (cognitive 23): mounted has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 9, ternaries 1. Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 8 function items inside it that branch (key, click, setOpen, \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":"marshall/assets/js/workspace.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"03adff09dda94ece71d37af35c664bcc4ed57a8ac792d79a5e3b72cbc13f842f"}},{"ruleId":"D2","level":"warning","message":{"text":"preflightDocument (cognitive 23): preflightDocument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e36892a5222d3143e8b271c9ef7e4a8933b6a44650528a7e66f7cc087a7f78"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaJourneyDescriptor.Parse (cognitive 22): MilaJourneyDescriptor.Parse has cognitive complexity 22 (threshold 15). 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":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2f20083ca40810c76bdfd3c52bfcbc458aa9245492a5413184ad16b5d0e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.query_socket (cognitive 22): GuestWitness.query_socket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce685662a7df683d81478dddb3f04c2a71b6d2446a3d58472ad8e41fe2977f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.new (cognitive 22): Client.new has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 7, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c82e95f2cd56d8d12f5a9490fe1336b0e964044dd55d56f66748f4f8544b3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketUpgrade.handshake (cognitive 22): WebSocketUpgrade.handshake has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (18 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":"audi/lib/audi/http/web_socket_upgrade.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a7fa03b05f31b3fa53e9490e5b4bd3072cca65fea16ace3c160bb35c02e587"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.handle_call (cognitive 22): Store.handle_call has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), match/switch 2 (4 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":"brady/lib/brady/cache/store.ex"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d895fc965d8e74ede990f12f3a9ff46e5214b41117be8c1b556175131f872e"}},{"ruleId":"D2","level":"warning","message":{"text":"Effects.run (cognitive 22): Effects.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2b7c01879993dcf0652cea15b9327d3ecf74098b435cdfd21f5750f56a19ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Usage.memory_limit (cognitive 22): Usage.memory_limit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/usage.ex"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e7d5eece72ee522766ed7913e808e82303a37e038abf032c3a2266f1bec7d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFS.policy_shape? (cognitive 22): ZFS.policy_shape? has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, if/else 2, match/switch 2. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68d8ec91b75fb6537a270f3944f15188ea723ac41d3b5e9c20fc96407944c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.init (cognitive 22): Server.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, match/switch 2 (3 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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f69f55fcb910a367f0e493cf36f84b55e1404dd0751761ac6a3ba7cac902e"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributionServer.init (cognitive 22): AttributionServer.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 3 (5 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":"lilly/lib/lilly/network/attribution_server.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4892a55819faf678768174fac376e69b6f7d874613323a2642078e1a9d5574b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.ensure_link (cognitive 22): Network.ensure_link has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ed5b3b818e84dad08c2a324c54cecdf20220c213703e606c64b684fcecc0fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Vsock.attach (cognitive 22): Vsock.attach has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 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":"lilly/lib/lilly/terminal/vsock.ex"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd194d6af0cd13ddbdd1caf60ce48b170595db6076974e0e7ee999305a180c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportCleanup.remove (cognitive 22): ImportCleanup.remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 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":"lilly/lib/lilly/transfer/import_cleanup.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d17e81ed0bbb43b6ac9ea1a2cd0e9981fa50ea9f3c47e8cd3f49568fdc308"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotIndex.pointer (cognitive 22): SnapshotIndex.pointer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, 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":"lilly/lib/lilly/transfer/snapshot_index.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d1af45a9877b945636240685c5c06bdb5544d2c150a784cb8d69294de6aa4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.begin_capture (cognitive 22): Checkpoint.begin_capture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"254457345867046a01781750c7330c276372c1adb3da5c68017199b2ae249f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.phase_valid? (cognitive 22): Checkpoint.phase_valid? has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 4 (5 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":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0e41bb3e421b5cb978ff1764ae5f6c6c255e56938f19456e999e56d1ddb806"}},{"ruleId":"D2","level":"warning","message":{"text":"Executable.static_x86_64? (cognitive 22): Executable.static_x86_64? has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/executable.ex"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65484364987f63b3b4756d7808ff4b08a9b03e1b8ff15eacef490a71578d678"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkloadBundle.materialize (cognitive 22): WorkloadBundle.materialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (5 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":"lilly/lib/lilly/vm/workload_bundle.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf244653d7ba7e9381be261266b602e1ad28c2d91469ed989925de6a402d9c92"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.lock_preparation! (cognitive 22): Context.lock_preparation! has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 5. 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":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a2fe2bf0d592938509ed4c8b417128b41ba45be0d828a0ef07ae62920c2fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Resize.outcome_locked! (cognitive 22): Resize.outcome_locked! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"marshall/lib/marshall/compute/resize.ex"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd91de24827a44e5a665b616f04c1c64c4cb088b48330435c81cb8cd55615ee"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHub.restore_marker (cognitive 22): GitHub.restore_marker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (8 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":"marshall/lib/marshall/github.ex"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6995b95b905fb232ed97c00fe2aad3f5665601b1234c024f107f24ba47f89b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStream.response (cognitive 22): EditorStream.response has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, 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":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecdbd23a21f54dd378056776d9e5286930313abe2254448e648b90b01c664f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageManifest.validate (cognitive 22): ImageManifest.validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 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":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"184de87c995b7216beb87264c1d97b1a8dd221ada13c795031655852c7589dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Spool.persist (cognitive 22): Spool.persist has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 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":"ziggy/lib/ziggy/spool.ex"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1acdecb8b09da222a0fc69cb7192a6c53e8c594e96e4f79ff9d2050428508c9"}},{"ruleId":"D2","level":"warning","message":{"text":"witness.parse_witness (cognitive 22): witness.parse_witness has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 9, ternaries 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":"antithesis/workload/guest_lifecycle/witness.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adbff5f55743ee0617db745b896890016c7d30ccfa25f0f8411fb2853610f14"}},{"ruleId":"D2","level":"warning","message":{"text":"assertions.scan_calls (cognitive 22): assertions.scan_calls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), ternaries 2 (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":"antithesis/verification/assertions.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0bec9a6dda8ee4efec2341305227886004d81a9a08ae18e59f5ac74ab38c77"}},{"ruleId":"D2","level":"warning","message":{"text":"resources.policy (cognitive 22): resources.policy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c479850846742f2f18052eca30dd6a501038ed2dad58bd23b23070b561e88a3"}},{"ruleId":"D2","level":"warning","message":{"text":"resources.compatible (cognitive 22): resources.compatible has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, 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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"435fb35803df4e62bf31fc9f400b4e7bb7ba2d10f5dfec8c8092ee553665ff9c"}},{"ruleId":"D2","level":"warning","message":{"text":"storage.prepare (cognitive 22): storage.prepare has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 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":"nix/domains/system/brady/storage.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"28763283ee261dac09c7c7792e3e77e9298a18cf7461c4e523544ea689bbf6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Rates.apply (cognitive 22): Rates.apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, 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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"f636ffa1870e0b6201c05f213769d09839d1b331ccb6f291107a2ac034e07b94"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.host_metrics (cognitive 22): metrics.host_metrics has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2, 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":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"716954323051423d3f638c0d2e4c8dd853fa2c99a2f1dc084207bbbe6ad44c49"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls.Route (cognitive 22): overalls.Route has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 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":"nix/domains/artifacts/guest/github/transport/transport.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbc332b0e0c40908c15e2fe410f6ea670d0cfe180e33d1b61f00a2792b3578b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::skills (cognitive 22): Scan::skills has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 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":"lyra/src/agent/context.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ad2ddc85758e8fb8f8a19d038be84812ed8ef5dc2f1e3fea869079d66a947"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::attachment::execute_transfer (cognitive 22): lyra::agent::attachment::execute_transfer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"lyra/src/agent/attachment.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"169180bcbaa8de90436fa59e530928f33cabe218af46ecf2fcc8f30ca6c0cf6f"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::attachment::download (cognitive 22): lyra::agent::attachment::download has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 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":"lyra/src/agent/attachment.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c4b2db67b8ed8e4053d7ef20ee5f4af6cff291c121b54361cca11281e9dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::maintenance::install (cognitive 22): lyra::agent::maintenance::install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/agent/maintenance.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bb59c3a2ac0a9528c8170d1943616be3be7d5c8cb1b56778148de62c03afe4"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::native_growth::illumos_vdev (cognitive 22): lyra::native_growth::illumos_vdev has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 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":"lyra/src/native_growth.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc67048b2fc97235a4bca802a65ed480ff55d02cc325eed4a6819eed45302688"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationSession::thread_action (cognitive 22): ApplicationSession::thread_action has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 6, match/switch 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":"mila/rust/mila-session/src/threads.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc789881fdf733a6e6e8a3cc7b886a7df9d4721a6102a7008ba87eadae0ee74"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::windows_main::probe (cognitive 22): overalls_vscode_web_broker::windows_main::probe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2e0d47d977b87652061fb59457d1bf00540be2ddeed1170e6f8a50523ccc5a"}},{"ruleId":"D2","level":"warning","message":{"text":"validateChecks (cognitive 22): validateChecks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 427). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c63bdf5af5c6d7b2f6c1d241c1eee00409eb1043bfc4831a3301fbe2e94bbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaWatchStream.Run (cognitive 21): MilaWatchStream.Run has cognitive complexity 21 (threshold 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":"mila/windows-dotnet/Interop/WatchStream.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f340b1c266c8233b49d364c4dfedd25f5ddf67abee697070fb342f534afd0"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaWindowsPushRegistration.RegisterAsync (cognitive 21): MilaWindowsPushRegistration.RegisterAsync has cognitive complexity 21 (threshold 15). 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":"mila/windows-dotnet/Interop/WindowsPushRegistration.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee47c1e46b65bea2c231679ca1cd4c48a484f7a02ba8c60e3027c4aea48c44f"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestExecutor.start_or_crash (cognitive 21): GuestExecutor.start_or_crash has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (8 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b68b7bd017d351b89f19fd0a12a622950536b9c2118203edc2f326a715a8571"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.grant_response (cognitive 21): Client.grant_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 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, 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":"audi/lib/audi/control/client.ex"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93121c50b7f32974ed433ec56450271c3032ac71f034b504e3df944eaf66731"}},{"ruleId":"D2","level":"warning","message":{"text":"Upstream.send_request (cognitive 21): Upstream.send_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (7 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":"galileo/lib/galileo/upstream.ex"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd77efeefbd816e213b39cd81eddda6b194a4bf086172fb0e1b3c5655a6ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.ensure_tap (cognitive 21): Network.ensure_tap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67a6bd30ec14eab56b02c0044a12be193780b7fa3a2659e32303b5dffdeadc"}},{"ruleId":"D2","level":"warning","message":{"text":"PermitJournal.grant (cognitive 21): PermitJournal.grant has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 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":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25acfa8fa9effc065708663e11ff432479be6c485a47459d95d7c4c4bdf1e95"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceivedDataset.owned_staging (cognitive 21): ReceivedDataset.owned_staging has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, match/switch 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb22d0465d7bbb26ba5c8394ad7ed81b9671c57c516ed4212bf14815673d23"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor.finish (cognitive 21): Actor.finish has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 2 (3 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":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a880bc867227d28b69b501e0f2ac62cda052314b009e5c650d7f293ed88ec22"}},{"ruleId":"D2","level":"warning","message":{"text":"Boot.read (cognitive 21): Boot.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 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":"lilly/lib/lilly/vm/boot.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a361456dc88706ee7eecb09299bd8ca61d45f724c1f4aac08d36f556d0b2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.cleanup_observation? (cognitive 21): CheckpointStorage.cleanup_observation? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 9, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db3d129d79f5a06795b2c13c1aaa88c9469c0442483e3c3d1c8896e6818a31"}},{"ruleId":"D2","level":"warning","message":{"text":"DeleteUserMachines.advance (cognitive 21): DeleteUserMachines.advance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 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":"marshall/lib/marshall/accounts/delete_user_machines.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2267c4027dd5e94a21b3af78c6f987b2200991a83026ac48818263e3434ba"}},{"ruleId":"D2","level":"warning","message":{"text":"HostReports.ingest_with_events_locked! (cognitive 21): HostReports.ingest_with_events_locked! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 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":"marshall/lib/marshall/compute/host_reports.ex"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b2d8ef16f280ecd6794e4a3057213f287c610cc8117f771d823a19b25a7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationCleanup.advance_locked! (cognitive 21): RelocationCleanup.advance_locked! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b852721186bdbc3e4a1c9a8d6a356a0f6eada13d9d2513b00abf5150fe78c514"}},{"ruleId":"D2","level":"warning","message":{"text":"CertificateAuthority.pending (cognitive 21): CertificateAuthority.pending has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (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":"marshall/lib/marshall/ingress/certificate_authority.ex"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eefa986901787320d21c2517fdd238212d5ae76c068fcf95d520614bed03b4"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStreams.peer_authority! (cognitive 21): WebStreams.peer_authority! has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 20, if/else 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":"marshall/lib/marshall/ingress/web_streams.ex"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa756a734588a245b9ce43fbb0610c98960595161d853e8f258748c2b59b5ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.load (cognitive 21): Config.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 3, 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":"susan/lib/susan/config.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdceef6f4462a5a5d4c2b4f55a2883a28a998ec1c64d7c0903518d6068c96a8"}},{"ruleId":"D2","level":"warning","message":{"text":"browser.run_stale_admin (cognitive 21): browser.run_stale_admin has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, ternaries 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":"antithesis/workload/access/browser.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"856f4c8f76228023611a44d2448fdbe5d118dad6aa8f5df7aafdaf9548ba1bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"MailLinks.wait_link (cognitive 21): MailLinks.wait_link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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":"antithesis/workload/access/mail.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d9fb923451640e40c13d85da5a99aca38ce15f82aa6b441310a6b6d2a8abcb"}},{"ruleId":"D2","level":"warning","message":{"text":"host_sessions.run_session_successor (cognitive 21): host_sessions.run_session_successor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecba77d811e2f2286453ddf05c62d46f7bcca5ad76cd192a67e6c9651cc153e"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_physical_boot_cycle (cognitive 21): scenarios.run_physical_boot_cycle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 3, error handling 2, ternaries 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":"antithesis/workload/guest_lifecycle/scenarios.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22022b7457fb13128adeb59adf91d98cf59f7803471e84d189af8543f64ea06"}},{"ruleId":"D2","level":"warning","message":{"text":"server.image_identity (cognitive 21): server.image_identity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/server.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d5790cf0007e8735753245885f70b6452492a6cff8913f58632f0f2c9bc82d"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke.main (cognitive 21): smoke.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/storage/smoke.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e96023422732c547b2ce4f709ab263ad2a33a493c53835db607ef20ddb73f6"}},{"ruleId":"D2","level":"warning","message":{"text":"identity._archive_members (cognitive 21): identity._archive_members has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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":"antithesis/verification/identity.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e90404bb39e3d35ddc0aca93c8649a003c1f226d67b8161f0d5de592a4a225"}},{"ruleId":"D2","level":"warning","message":{"text":"selection.manifest (cognitive 21): selection.manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"antithesis/verification/selection.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba12f76833cc7b3248126a813e11d9920dd7779a8718d72d45a6940468f968"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_platform.parse (cognitive 21): mila_platform.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"buck/mila_platform.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7685c9d3d25edeca2e870edd051a4fd449c11207842ffe45111c84db52f0874b"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_freebsd.extract (cognitive 21): extract_freebsd.extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/native_git/extract_freebsd.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b33c2e34360c9b6d24078a03590999b062b24d8dedbf0ffebec95d07658998"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_freebsd.extract_member (cognitive 21): extract_freebsd.extract_member has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"nix/domains/artifacts/guest/native_git/extract_freebsd.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"057eab092b96b37bbb0cc8e2ea6b7031557078f1937999bccc8ae79d871ae52d"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.wait (cognitive 21): transport.wait has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, error handling 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":"nix/domains/artifacts/guest/nesting-probe/transport.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a101c822aba62fabf9fc9fffda7179e6aad5faa6152477c0e2469a9508d3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaMachineWorkflow.submit (cognitive 21): MilaMachineWorkflow.submit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, error handling 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":"mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6cc7a2632efe1bdc4187d071fd3fdc03705cdcca913be419e2a04e107ac8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaMachinesController.load (cognitive 21): MilaMachinesController.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaMachines.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e4feeccf0c597d3bb8de45a67521c868c0a42b5eb345e386e776da555d4387"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::exec::reap_forever (cognitive 21): lilly_hostd::exec::reap_forever has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 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":"lilly/native/hostd/src/exec.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"352ceb496dcfe29f8dc9b225814ae1ea8316ee5c5754405e4e50632ac24bc74a"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_ingress_bridge::run::run (cognitive 21): lilly_ingress_bridge::run::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, match/switch 2 (3 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":"lilly/native/ingress-bridge/src/run.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91a49d56efc6db20672e6655cb35b155ff41817c38961906182f8ff774784c5"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_protocol::lex::lex (cognitive 21): mila_protocol::lex::lex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (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":"mila/rust/mila-protocol/src/lex.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e99a819810d10021a9dae3ac57528e4ae0e875b88be82e2792c87ed873098"}},{"ruleId":"D2","level":"warning","message":{"text":"check-extension.main (cognitive 21): check-extension.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 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":"nix/domains/artifacts/vscode-web/check-extension.mts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ba03b1044e68bf69624ad79a9a50421153e1fa59c4c3ceb0dad2d0e310f755"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopbackTrustListener.ServerName (cognitive 20): LoopbackTrustListener.ServerName has cognitive complexity 20 (threshold 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":"mila/windows-dotnet-uia/LoopbackTrustListener.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af6a3a9ee92788107070e05a5e0455e1051750fa8cac6768b59eefb634b960c"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestRPC.call (cognitive 20): GuestRPC.call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a45d6d9924fbcd544ed7cc162b60ae24fac9084cdf0f77e32ebd58a56f7ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"QualityMarker.staged_write (cognitive 20): QualityMarker.staged_write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 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":"elixir/request_accounting/lib/overalls/request_accounting/quality_marker.ex"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610b59b24399219ad7496548da1577579f0ff60d715a2c29ad977508cf6a1a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Backup.main (cognitive 20): Backup.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), error handling 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":"lilly/lib/lilly/backup.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d57fff2d0149bf0d8ae4aaaa5ce78d5a5dfe43bfaba20bd73d691dd9e50ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.parent_claim (cognitive 20): ZFSDataset.parent_claim has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bebd2946ba3d92d5c5823716fdfb13926648ad1232cce834e10c82c64c665fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Persist.persist (cognitive 20): Persist.persist has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 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":"lilly/lib/lilly/lifecycle/persist.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"df26bff41cd355bed6ba3a061eba9b7fa8568d9b0892bb8a5ad0df4213a3e882"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.refresh_labels (cognitive 20): Network.refresh_labels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"924443505efc848f3b7437c6430fcfad2a147d8393f91449c3d5346917f79ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.destroy (cognitive 20): Network.destroy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf220333ad75d6e8137a2a72ac75515e4f96a91d4bac2a53fdca1a8719c9457"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.serve (cognitive 20): Server.serve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 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":"lilly/lib/lilly/private/server.ex"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca6589c4b4059c8c7576fb2fda438a0ce836a49851f8ed170d636cf66b5b29f"}},{"ruleId":"D2","level":"warning","message":{"text":"Importer.adopt (cognitive 20): Importer.adopt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"lilly/lib/lilly/transfer/importer.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be961c3bb765c751447ba309e87ec0d8531b88bed5f3b4dbe9bbbf93c7bf4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Key.load (cognitive 20): Key.load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 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":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de8cfe3d27ab13a75157e3f5a4ed23cd620c28b147226caeed7ab0340a8c718"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor.schedule (cognitive 20): Actor.schedule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, error handling 1 (4 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":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e269b0a0340bbf73388a2e20a22e9f52f4f65b50ba674337e4e7bd6f4051e8"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.verify (cognitive 20): CheckpointStorage.verify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3083180fb61496ef0bcd392343d44970bc6c52515eafeb98e2a7d3aec2022b"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.cleanup_native (cognitive 20): CheckpointStorage.cleanup_native 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3108bd5114a0f3575f5f8e049b41719c51a1a37d5465693bc31498c3234e6046"}},{"ruleId":"D2","level":"warning","message":{"text":"Disk.materialize_empty (cognitive 20): Disk.materialize_empty has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 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":"lilly/lib/lilly/vm/disk.ex"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"632d13fa105356a29a409ca2c6eaa2ac3c686955151b74d3ccef05c28d10b924"}},{"ruleId":"D2","level":"warning","message":{"text":"Enrollment.verify (cognitive 20): Enrollment.verify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, match/switch 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":"marshall/lib/marshall/compute/enrollment.ex"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b25e6b0d2905755c33031fb63e9e08b6f4901277ae67c717e65c2b7520517"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationReceives.valid_source? (cognitive 20): RelocationReceives.valid_source? has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 7, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb7587b50a7fc6a26c77a649605de757d78a4f5b420f3de92b7c136da120dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHub.cleanup_authorization (cognitive 20): GitHub.cleanup_authorization has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/github.ex"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2414910f6b2b0d61d9fa0d2cbb254807a9dca36c75edf4c80ccf7bb70a643b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Authority.session_for (cognitive 20): Authority.session_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, 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":"marshall/lib/marshall/terminal/authority.ex"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3018637bc5c365ddff882d5f5b37b604e019e6497ac21402be1d25d63af10703"}},{"ruleId":"D2","level":"warning","message":{"text":"Creation.reserve (cognitive 20): Creation.reserve has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (6 pts), match/switch 1 (2 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":"marshall/lib/marshall/terminal/creation.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"51139661dc798dbd5b359af31e12384673a1ceb3796f891c1010a21774ae235b"}},{"ruleId":"D2","level":"warning","message":{"text":"Termination.observe_absent (cognitive 20): Termination.observe_absent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 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":"marshall/lib/marshall/terminal/termination.ex"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"be622069abd467ec9fc2e5b838ae11443799a1ac44cd187f11dc8feab78196fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.new (cognitive 20): Client.new has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 7, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/client.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4553e3909c1eaa613ff18784af37339b87e8d9a9801ed78821b072d8ce2db849"}},{"ruleId":"D2","level":"warning","message":{"text":"Reflection.validate_guest (cognitive 20): Reflection.validate_guest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 4, 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":"protocol/lib/overalls_protocol/reflection.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"28173b0fae29b5d661207be735cc4189204660b07b194ee187a04d7844c886c9"}},{"ruleId":"D2","level":"warning","message":{"text":"SSHKey.parse (cognitive 20): SSHKey.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/ssh_key.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bca5278065dd547b6fe8c25958a8f66ab9d150593fbda73100e15dcfbf4f713"}},{"ruleId":"D2","level":"warning","message":{"text":"WebStream.response (cognitive 20): WebStream.response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, 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":"protocol/lib/overalls_protocol/web_stream.ex"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b5f747b735c290ebc0232a5c8db3f1a3c6b70cee129ca5007f13a96bbab653"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaWatchKt.runMilaWatch (cognitive 20): MilaWatchKt.runMilaWatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaWatch.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad86572a264d0732652c65f8e0c541d4ca5c699ea047ce9429b8ad97967c7564"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveView._collect_events (cognitive 20): LiveView._collect_events has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 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":"antithesis/workload/access/liveview.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a641578f2c1079f76417590c98dc4d887ade7e7e5fd2d08acee57b56047705"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlSession.exchange (cognitive 20): ControlSession.exchange has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (4 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":"antithesis/workload/control/client.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6bb37274d81fb31cbde5f56024e6297b21f349b004e6e2b9476215b571981b"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlOracle.credential_authority (cognitive 20): ControlOracle.credential_authority has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 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":"antithesis/workload/control/oracle.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7958603fdfa8330939780094329b4ebc524aea259c5b1d42b1fa4aa79d00e56b"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_bind_before_effects (cognitive 20): scenarios.run_bind_before_effects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"antithesis/workload/control/scenarios.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac64cedbf754b4c18328773b318ec5a9b5c66e1cafdfbdea36a951fdad5eaea"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_replay (cognitive 20): scenarios.run_replay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, 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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9061f809729e21d284f7e345c7bbff35322bb40c512ce7daefc9aa69e86e99a3"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestProbe.open (cognitive 20): GuestProbe.open has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, 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":"antithesis/workload/satellite/guest.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d721ee59c8c3ab3ca47f550bc6de4e53c65e508f2d7402a16f4f0b3a9caa20"}},{"ruleId":"D2","level":"warning","message":{"text":"mila-tailnet-join.main (cognitive 20): mila-tailnet-join.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":".github/scripts/mila-tailnet-join.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a16c5d5e1b0f417a76f8c3713cfa498996fec1f9d0120371fed1271419557c0"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.activate (cognitive 20): bootstrap.activate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 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":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"611bc61226f798c356e43087518371debd7e9af9e52ba369551263bb7e497404"}},{"ruleId":"D2","level":"warning","message":{"text":"campaign.main (cognitive 20): campaign.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"antithesis/verification/campaign.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385497ecda300d817ae852cf7f71d106ab453151cffb3bd8d15bbf6bda7027d"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_platform.run (cognitive 20): mila_platform.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 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":"buck/mila_platform.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2089c9400bb73eab0c87293b3bd76c95b51af6666e396ed4b9a26595bf402f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"publication.collect (cognitive 20): publication.collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 6 (7 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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c2da2a161956c67f7eadc469feb2ea6ee7f20f1c223950a9534e737e4c3e94"}},{"ruleId":"D2","level":"warning","message":{"text":"native_image.check_installed (cognitive 20): native_image.check_installed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"711be36f82c67f717b0d07e87469278e0a50a6ae9de544ebe6e84296054e0d39"}},{"ruleId":"D2","level":"warning","message":{"text":"native_image.check_effective_trust (cognitive 20): native_image.check_effective_trust has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1, ternaries 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e780e985d7cc0a0cc06b564ea7c561e7139e4ae42bff372d0c16bcf31dd38c92"}},{"ruleId":"D2","level":"warning","message":{"text":"extensions.archive_entries (cognitive 20): extensions.archive_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d8af3fa9747cf97928fe685c67da8e5eaa9948145a9ab9a87eb829affeffa"}},{"ruleId":"D2","level":"warning","message":{"text":"extensions.stable_candidates (cognitive 20): extensions.stable_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, 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":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eff4e3aa05c5750ad1dde93d909c44bd5933106aeb946edb069b3991153031"}},{"ruleId":"D2","level":"warning","message":{"text":"lookup.configuration (cognitive 20): lookup.configuration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, 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":"nix/domains/system/acme/lookup.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"48801939b540d02a50d8ee976c297eabc77b3272e9576c8df5003a682a546c16"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.pressure (cognitive 20): metrics.pressure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2189862a3a3ffb47d9fa81e9e9bf3876d8ba1f11db8ceeac1526fbfcfa8cadd"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::bin::overalls-host-certificate::read_response (cognitive 20): lyra::bin::overalls-host-certificate::read_response 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":"lyra/src/bin/overalls-host-certificate.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"46428122b911bb3a8ab8bc7441c907ea668ea53d580fe8263477f3cd6aa8b51a"}},{"ruleId":"D2","level":"warning","message":{"text":"grid.adjustMediaPadding (cognitive 20): grid.adjustMediaPadding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). 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":"marshall/assets/js/grid.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f220f42cdaed652fb9cc7d411890d22f447f36335033671ac17111805a156b82"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare-windows.prepare (cognitive 20): prepare-windows.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/prepare-windows.mts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"27414a77a63ab9c16baee5da8ab6003c24b6efa8855e52eb23076ce0e1c6db8f"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestExecutor.current_boot (cognitive 19): GuestExecutor.current_boot has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 9, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"57827bb998502a05ee84dda5672c76db8acddfe50addaae346a442efca294aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.sanitize (cognitive 19): GuestWitness.sanitize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fcd6d5c5d904691d4bbeae0788a6a062ef6fbaa2fe7d06499795bc8db1c160"}},{"ruleId":"D2","level":"warning","message":{"text":"Probe.check (cognitive 19): Probe.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"audi/lib/audi/tls/probe.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d05d6d0ec356755cecea713aef1ef2a4294c17ef9a41e2700f050862cf09d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Pressure.validate (cognitive 19): Pressure.validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 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":"brady/lib/brady/cache/pressure.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f9e5c674375f19dbe687dfc5bf03d2b9fa89f9b97a3b1c4917744b3ebac1b2"}},{"ruleId":"D2","level":"warning","message":{"text":"HTTP.proxy (cognitive 19): HTTP.proxy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, 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":"galileo/lib/galileo/http.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a412029f44b0736271b98d2fa37691a7c7423e0ccb813c808edc33b7cbbeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTemplate.verify_hashed (cognitive 19): ImageTemplate.verify_hashed 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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"89788bb37d70a80e9fe7e0a1e97fc103a369047791e3a842bf7343712ff1d5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivateFiles.write (cognitive 19): PrivateFiles.write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 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":"lilly/lib/lilly/host/private_files.ex"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"185344c9372c6384db37404c25e7681894e7ed35520bb98baf7312a235535506"}},{"ruleId":"D2","level":"warning","message":{"text":"Propagation.observe (cognitive 19): Propagation.observe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 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":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54b54e36d587eff4c81a301b11c6ebbe0dc408f0e1fe3107309781a03cb7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributionServer.serve (cognitive 19): AttributionServer.serve has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (8 pts), error handling 2 (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":"lilly/lib/lilly/network/attribution_server.ex"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfd2d4c5756dc7dbc478f2df64d8ba002720c48a094a9211c26f5f01fe5aa7e"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneCopy.stage (cognitive 19): CloneCopy.stage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"lilly/lib/lilly/transfer/clone_copy.ex"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d570a9c2a65e50edbc723ff3242555591f1edcbf88ebd1bd56849d47779cbcdd"}},{"ruleId":"D2","level":"warning","message":{"text":"DestinationCleanup.authorized (cognitive 19): DestinationCleanup.authorized has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 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":"lilly/lib/lilly/transfer/destination_cleanup.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da17381c9e2326960e71ae6f09390d9dbd16ab408d8f95ca5c0cda4071cb076"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportCleanup.cleanup (cognitive 19): ImportCleanup.cleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, 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":"lilly/lib/lilly/transfer/import_cleanup.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2aba4d9b28bc101bbbf4f02c9021c25a249473272bb09ee824e6cffc6346f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Key.locked (cognitive 19): Key.locked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (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":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd8bd6fc9e5c405c94dbc6f396823848702e8c33358cce5ccca75a745afa737"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.audit (cognitive 19): CheckpointStorage.audit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9e2e24bef38c7a151b64e0d2042011ba684b1b4aa0bb432a3c50930b8c44a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelCalls.claim (cognitive 19): ModelCalls.claim has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), match/switch 2 (3 pts) (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":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c929e6693262b089bd460341fa1fabeb0175c6309277e5f599f6e06684af8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Admission.allocate (cognitive 19): Admission.allocate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), match/switch 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":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8b88e99fd0317610b940dbaf3f125ada7b83ab2c663f2ccd48561d11c246a"}},{"ruleId":"D2","level":"warning","message":{"text":"LifecycleAudit.record! (cognitive 19): LifecycleAudit.record! 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":"marshall/lib/marshall/compute/lifecycle_audit.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d2c1f43ab98daa220a50848670bf0d7fe90a2d4940a2d1ee92a4541fb8aa50"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationReceives.commands! (cognitive 19): RelocationReceives.commands! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 3 (4 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":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4573f7b70995e242ea16e25d3d5ff0abe0e50b7bdc9a8bc01c283c02bd4b5df"}},{"ruleId":"D2","level":"warning","message":{"text":"Authorizations.current_vm! (cognitive 19): Authorizations.current_vm! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, 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":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6fcd612f31e60274780b4af06f504b21b320dd6aaa6dea30515fe641f4cb83"}},{"ruleId":"D2","level":"warning","message":{"text":"Requests.current! (cognitive 19): Requests.current! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, 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":"marshall/lib/marshall/inference/requests.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2691186d1f81b80431238e648152f68d09e877442d3df609f6fa822493ca5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.execute (cognitive 19): Coordinator.execute has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (7 pts), match/switch 2 (3 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":"marshall/lib/marshall/threads/coordinator.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3803584d9e1534341f78007efa8c232bb965019efe058b57e3dccbde866e4835"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel.subscribe_watch (cognitive 19): Channel.subscribe_watch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 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":"porsche/lib/porsche/ssh/channel.ex"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"961a118a227e08b2b1dd46b49746f2e742aef0068d38ec29755171ab1e948d18"}},{"ruleId":"D2","level":"warning","message":{"text":"Poke.effect (cognitive 19): Poke.effect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 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":"susan/lib/susan/poke.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac774cec4f5038306320088460dd3833c4da87524b8124dac99967a739437d31"}},{"ruleId":"D2","level":"warning","message":{"text":"host_sessions.run_credential_rotation (cognitive 19): host_sessions.run_credential_rotation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, 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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c9d18e9d9778d5e177de0eb4848d6105264a799853c8a8b36d3f4dcdb8abbb"}},{"ruleId":"D2","level":"warning","message":{"text":"RotationCoordinator.rotate (cognitive 19): RotationCoordinator.rotate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 4 (7 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":"antithesis/workload/control/rotation.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13d96b0cc85c19745903c722d9dcb5c75651cc542a0954483458e98116216a"}},{"ruleId":"D2","level":"warning","message":{"text":"standin.serve (cognitive 19): standin.serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/standin.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0dab7a823d60219c148d39afde2ad22e4a3595684b9c0644f47d85ccbe46a1"}},{"ruleId":"D2","level":"warning","message":{"text":"mila-tailnet-join.read_status (cognitive 19): mila-tailnet-join.read_status has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/mila-tailnet-join.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86985c08ab71130cdc5142ae5f78ea9812f677e4e236537c32148ac51abf111"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.status (cognitive 19): runner.status has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, error handling 1, 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":"antithesis/emulation/recorder/runner.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38bcaf75a8f8a2bad9dd985ff3d5b8d13a5b458b2efaa04e5f38cd09b2a6f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.setup_mirror (cognitive 19): bootstrap.setup_mirror has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/storage/bootstrap.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3ac783b6854a28d38b5bbada5dcb2f8b2b758627eb4fdcac6c02253183771"}},{"ruleId":"D2","level":"warning","message":{"text":"oracle.nft_counters (cognitive 19): oracle.nft_counters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, 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":"antithesis/emulation/storage/oracle.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9969b06ec12027654371f8d407b9f0c85f85957f2251e3ebaeb8fa8d9766f9"}},{"ruleId":"D2","level":"warning","message":{"text":"packaged_instrumentation.load_journey (cognitive 19): packaged_instrumentation.load_journey has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, error handling 1, 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8837b071ed4b21482e8df7efe949804ece87e58876cf59f5b01f1e3f7a8ccd07"}},{"ruleId":"D2","level":"warning","message":{"text":"boot_report.report (cognitive 19): boot_report.report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2, 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":"nix/domains/artifacts/guest/boot_report.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c3de4c496bd8817e3e5881cf033c7d6d0938104218aa518cfe59210d6e4073"}},{"ruleId":"D2","level":"warning","message":{"text":"stage-winget.stage_vs_layout (cognitive 19): stage-winget.stage_vs_layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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":"nix/domains/artifacts/guest/windows/stage-winget.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"938007dd798a223e4a849dc8cc1fec94f4c5c99f568f76778c62d766d2e07819"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.metadata (cognitive 19): cli.metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1, loops 1, ternaries 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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"757e685ef0ef8bda44917727c4c5283b219f80791cc876b4413926e036e19a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"extensions.validate_artifacts (cognitive 19): extensions.validate_artifacts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b439c8f2f95162f4414f478da9543e0674cee2f5b787ce09f15d21823a014344"}},{"ruleId":"D2","level":"warning","message":{"text":"manage.reconcile (cognitive 19): manage.reconcile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), error handling 1 (2 pts), ternaries 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":"nix/domains/system/cloudwatch/manage.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9c65dac5f95bfd2ead4eb90346253932b5938c48744ef1e494d70fc7f1263"}},{"ruleId":"D2","level":"warning","message":{"text":"MachineDetailView.body (cognitive 19): MachineDetailView.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 3 (5 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c473cfd4103c01a3e4863da5b1dca7d5a2022610ecaf1f795f906702425551f"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_export_channel::serve::serve (cognitive 19): lilly_export_channel::serve::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/export-channel/src/serve.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb99ece40bcd25762e94c3377fecfbcd26560a8f1680638384cda0ec8f8a96c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Leases::acquire (cognitive 19): Leases::acquire has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 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":"lilly/native/hostd/src/leases.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38983acb5ab38a4022401ef8bb582f8c3d4ee2ed170885995cab1d6be728df"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::exec::run_inner (cognitive 19): lilly_hostd::exec::run_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3, 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":"lilly/native/hostd/src/exec.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadd0188311b2d7a32ee827ceab64da6159681ba111709f8943a1caa7b09eb39"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::policy::check (cognitive 19): lilly_hostd::policy::check has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (14 pts), boolean chains 3, if/else 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc5c0f136af5ba4fcedafc863707f8ee546c658317a33d357cf84a61a07ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::bin::overalls-native-workspaced::main (cognitive 19): lyra::bin::overalls-native-workspaced::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (4 pts), boolean chains 1, loops 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":"lyra/src/bin/overalls-native-workspaced.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2edd926dae68c3d6c93e7f0d931445defa52cc4ec6046578bcacd7bf4889da1"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::bin::overalls-workspaced-windows::daemon::run (cognitive 19): lyra::bin::overalls-workspaced-windows::daemon::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 6 (9 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":"lyra/src/bin/overalls-workspaced-windows.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f004a15c58f42eded8ce4f9137d9a3757998cd386b22c1f364dfc83a46e166c"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::ssh_config::local_identity (cognitive 19): lyra::ssh_config::local_identity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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":"lyra/src/ssh_config.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"242899bd869cfe71c9ae2617932cc8e17582d934495bca5a1d370708ba167a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_ffi::validate::trust::mila_trust_document_reconcile (cognitive 19): mila_ffi::validate::trust::mila_trust_document_reconcile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/validate/trust.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70551c4a13d13fcc77e0aee2b1f27e92edc9da2fc1c3d34849411bfe69edeff"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_transport::cert::parse_host_certificate_blob (cognitive 19): mila_transport::cert::parse_host_certificate_blob has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 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":"mila/rust/mila-transport/src/cert.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617583a2cca0f5397e1e2005339e4545be046ea9123456924489a6c7cb44048"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon::pump_loop (cognitive 19): Daemon::pump_loop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), match/switch 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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2453e3bdd539e499e376f7cceea698ea1b701e81c24a6ca78fe425950dcc8"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::linux_main::unit_metadata (cognitive 19): overalls_vscode_web_broker::linux_main::unit_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 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":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef71edfd26661d3006aed863147bafc33a71c437df69518ebc347c3db129ac94"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::sanitize::sanitize_traces (cognitive 19): overalls_otel_guest_receiver::sanitize::sanitize_traces has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 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":"nix/domains/system/otel-guest/receiver/src/sanitize.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdb3364bf3f31f09f2fedf09f97fafba76a4cdd5a2067a952d941d5cbdf7e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"artifact_frame.parseRequest (cognitive 19): artifact_frame.parseRequest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 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":"marshall/assets/js/artifact_frame.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"140cc0d71994445e356bac2f5773bd02ea6a6923fff0160c03556aee34af873d"}},{"ruleId":"D2","level":"warning","message":{"text":"Pane.writeOutput (cognitive 19): Pane.writeOutput has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 8). 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 (a function literal at line 585, finished). 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":"marshall/assets/js/terminals.js"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a370d00e8960e42cfc5447543fbcdc9b988d1ee9eaa902b17ac846e8d717e72"}},{"ruleId":"D2","level":"warning","message":{"text":"attach (cognitive 19): attach has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 6, ternaries 1. Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 489, onmessage, a function literal at line 474, \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":"marshall/assets/js/terminals.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a32ad855d385c8bc6cccc94bd9c02f9acb14bb1501ff95a18811a5cdfc5a56"}},{"ruleId":"D2","level":"warning","message":{"text":"renderSessions (cognitive 19): renderSessions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 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":"marshall/assets/js/terminals.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b939afc7bf8c8a7c9509b040ed5b49ab10b36a11d53465a3b7ad0c78ca213d8"}},{"ruleId":"D2","level":"warning","message":{"text":"loadingFinished (cognitive 19): loadingFinished has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, ternaries 3, if/else 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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47912a96e0d1bf1fe0433a105d15ceeda3ea708843646806f445dbcf6d97131"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaTerminalFrame.Decode (cognitive 18): MilaTerminalFrame.Decode has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/TerminalSession.cs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69022b41cc28f7d6b47ebaaf3529a7380a2cdab7d5933be08c75a46251bd383"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaWindowsNotificationDevicesController.DecodeListing (cognitive 18): MilaWindowsNotificationDevicesController.DecodeListing has cognitive complexity 18 (threshold 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":"mila/windows-dotnet/Interop/WindowsNotifications.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6617ea4af4c4413620693e5e74bb11b8e52d9884d05234b25d18d91947ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"JourneySmoke.RunAsync (cognitive 18): JourneySmoke.RunAsync has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0433745c64ad8e4b5342f00c46fb6e91a617d13031dd8b70bb70b4caffe778"}},{"ruleId":"D2","level":"warning","message":{"text":"Attribution.request (cognitive 18): Attribution.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"brady/lib/brady/attribution.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6bfe2c9dcbdf7eaa105d684adc1194960ed365ee09bde89b39f1beaf9e9a85"}},{"ruleId":"D2","level":"warning","message":{"text":"Metrics.request (cognitive 18): Metrics.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, 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":"brady/lib/brady/metrics.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f371ef9bee8ccd701a7a5dee23b6960c099f7dab63a387e3165a591597666"}},{"ruleId":"D2","level":"warning","message":{"text":"Hello.records (cognitive 18): Hello.records has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (7 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":"brady/lib/brady/tls/hello.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dd70e8d209caffbb22a83a2e503903885a7833030096b34576f8df6afaa3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Pool.new (cognitive 18): Pool.new has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/pool.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"495e3abf6e0e6237f385a985601070e274e02d19dba75d2786a50e4137e4a437"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.claim (cognitive 18): ZFSDataset.claim has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a7ca16e78838d3ceca26c5e4e6c327c59ca42bc847fec1e4b1b8596176a88b"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.init (cognitive 18): Server.init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/private/server.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"50388999db4b9b96db22d3f5eab5993508c8739b7cf8d339bd5277c323e31368"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneCopy.adopt (cognitive 18): CloneCopy.adopt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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":"lilly/lib/lilly/transfer/clone_copy.ex"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"605f2d30307632ed8b0bcdcc9eb4527d38f062462c80b05b3c7b420e601795c6"}},{"ruleId":"D2","level":"warning","message":{"text":"PermitJournal.authentication (cognitive 18): PermitJournal.authentication has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (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":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13008ca548062067c4e902e9d7d59860d8cdc44e0f6d64871543af5b9ad6257"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceCleanup.execute (cognitive 18): SourceCleanup.execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/source_cleanup.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"49af7fd5fc1d5602667144ac8f1206e2c644ba86d91eba7fc2561cb6542371a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpoint.valid_record? (cognitive 18): Checkpoint.valid_record? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d434d57e28d8eef00ea6c28fceff0f90af023b1c1918af88fe8444f879e53d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.mounts_valid? (cognitive 18): CheckpointStorage.mounts_valid? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"577a8c834e394c1f5c7d0ab33974b5a3c8ac4acf48ba1f1fd800ab419824bf0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.retire_transfer_destination (cognitive 18): Driver.retire_transfer_destination has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0486816c82820ffa384e0be7d341b560fbf7c8142b5e381e3afb2ec8da5cca3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.ready_boot (cognitive 18): Driver.ready_boot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f23b549f45f933631d7c3efba5a06e4a28b521da51f5e20a8d49bb167660a"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.start (cognitive 18): Executor.start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a98eeef01a004f75a3b03da698e6c823227e3f04e09217958864b3fe437a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Journal.read (cognitive 18): Journal.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, 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":"lilly/lib/lilly/vm/journal.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7457ffc298cba65e3a67456f24c7fa57904cda7405e80a0458ffe69dce074c"}},{"ruleId":"D2","level":"warning","message":{"text":"Provisioning.begin (cognitive 18): Provisioning.begin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 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":"lilly/lib/lilly/vm/provisioning.ex"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"96988b48f81498e8ea654ad1762d317f15806a1cec7964f0f314c94973efd0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationRestoration.confirmed? (cognitive 18): RelocationRestoration.confirmed? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 5, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_restoration.ex"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f229e8b17048a9085e33344dcb7a7e22160ad516e703c8b7113ed3ea2f50bb8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceLevelPublisher.publish (cognitive 18): ServiceLevelPublisher.publish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 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":"marshall/lib/marshall/compute/service_level_publisher.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a7e2e686ebada668cb9f576834b20e14895dcfdb7e033d87c87a2715d02369"}},{"ruleId":"D2","level":"warning","message":{"text":"Configurations.validated! (cognitive 18): Configurations.validated! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 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":"marshall/lib/marshall/galileo/configurations.ex"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7985684ebb9a70a7d56b1ae049a1e9ce56188fe60aa2fd201eda70ab0afec69f"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHub.revoke_connection (cognitive 18): GitHub.revoke_connection has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/github.ex"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6c65469e2830fd2d611a3957f5e9c789a7b55f834d0c0c0977df7ada1a0c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.restore (cognitive 18): Request.restore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"marshall/lib/marshall/ingress/acme/request.ex"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"85877a7f61ba6a9cc3e0e08fcc269b8cc1dd5f674e69535eea749e8cade28f08"}},{"ruleId":"D2","level":"warning","message":{"text":"CertificateAuthority.request (cognitive 18): CertificateAuthority.request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"marshall/lib/marshall/ingress/certificate_authority.ex"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cd1679ced8584b0415a2de8d7abf59ff70228827226b2a57727d9f1ae7493a"}},{"ruleId":"D2","level":"warning","message":{"text":"WebLogins.perform (cognitive 18): WebLogins.perform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 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":"marshall/lib/marshall/ingress/web_logins.ex"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f535acf959fe814b470a6750b4b0b61d099b03821d4ce8e28fd35017b47d66c0"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCertificates.issue! (cognitive 18): HostCertificates.issue! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), match/switch 1 (2 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":"marshall/lib/marshall/ssh/host_certificates.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba8fac262febf5dee261f98f52c9163f6d597e1dd8ade61f7d81399a9a122dc"}},{"ruleId":"D2","level":"warning","message":{"text":"MachinesLive.handle_params (cognitive 18): MachinesLive.handle_params 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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbb790ac591f78c0e943de07bc60d824d5479ffa11e966835ef68a6ed8ee583"}},{"ruleId":"D2","level":"warning","message":{"text":"LocaleCatalogCheck.count (cognitive 18): LocaleCatalogCheck.count 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":"marshall/scripts/check_locale_catalogs.exs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c76ec0b644209684718bd7eb352ef52ca8e74264f691589ae9001820d4a3080"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentStream.recognized_pre_output? (cognitive 18): AgentStream.recognized_pre_output? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, match/switch 3 (5 pts), if/else 3 (nesting depth added 2). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/agent_stream.ex"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0925b3ea053ba0fa342f91ff954ee04cba64a63e5afaa48c8b41306f121a1b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"SLOCheckpoint.decode (cognitive 18): SLOCheckpoint.decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, 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":"ziggy/lib/ziggy/slo_checkpoint.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff3373f1e01d32f2a21b5107946541a811888ad4e55485f46bd6c9c6df9c9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.operation_view (cognitive 18): domain.operation_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7 (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":"antithesis/workload/guest_lifecycle/domain.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789e723209d3d01d03c046eabdc6bd990dd09dfea6c50ee085e42110e0f9b46"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios._sample (cognitive 18): scenarios._sample has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"antithesis/workload/guest_lifecycle/scenarios.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c6e8ed2e8f8b65c1b46127b0e853e83bbc5dffcde0db666bc5e95f64618b5"}},{"ruleId":"D2","level":"warning","message":{"text":"scenarios.run_create_replay (cognitive 18): scenarios.run_create_replay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 1, ternaries 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":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31d5e029c6d630e56986ae3801fc73808b045d7a5096026538908228abd57f7"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.observe (cognitive 18): runner.observe has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 6, if/else 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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2bf420fd11944bc7be90a221c0430ef0017cbe0e2a555cf23a1d19343e3076"}},{"ruleId":"D2","level":"warning","message":{"text":"server.parse_terminal_snapshot (cognitive 18): server.parse_terminal_snapshot 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b84d5760c597d69b01b26130c2e62eaee2ca1be91675870c6692dcef9a4159f"}},{"ruleId":"D2","level":"warning","message":{"text":"monospace_browser_probe.check_thread_views (cognitive 18): monospace_browser_probe.check_thread_views has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42bf5d78a5522cd009b71ab8775611008d609dd7f9980c3f77dca94944e6b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_sdk.assemble (cognitive 18): fetch_sdk.assemble 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":"nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c827bc2892de6f4f5c2a817bae0ccf9d674b27c20b63209ee56fb215bab18c"}},{"ruleId":"D2","level":"warning","message":{"text":"native_image.check_symlink (cognitive 18): native_image.check_symlink has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ff121a4aa22861946965d33fad270e46dbff1690545e19bffb9c8cb46d929d"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize_nix_db.normalize (cognitive 18): normalize_nix_db.normalize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/ubuntu/normalize_nix_db.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff58ac33356985939fddefb41c006b656cc426dbc46cbb60e05ef361ac6f6860"}},{"ruleId":"D2","level":"warning","message":{"text":"remote.inventory (cognitive 18): remote.inventory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (3 pts), error handling 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":"nix/domains/artifacts/host/remote.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdec63215096079371620e992f01554f8004330ef371795c2601e296a8ef875"}},{"ruleId":"D2","level":"warning","message":{"text":"check-browser.cleanup_children (cognitive 18): check-browser.cleanup_children has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (9 pts), loops 4 (7 pts), if/else 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":"nix/domains/artifacts/vscode-web/check-browser.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f058ce034e2aeca524f2a7027d69af33a1b12553df1b5bad3c460697e2418bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployment.run (cognitive 18): Deployment.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (2 pts), 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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbbed81e2256f75e9ef297e6f0d13a640e07f392e98b306c599ad455cb35fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.zfs_metrics (cognitive 18): metrics.zfs_metrics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/fleet-exporter/metrics.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3feaccbfdf797d3c06c4871a71f1d4eb0dc53350ab85b122aee7f81f11054b"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::policy::ip (cognitive 18): lilly_hostd::policy::ip has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 1, loops 1, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b15be771c168aeb2bfeddc845460215f2ed8973e2a74e15ffc6487338b1d79f"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_zfs_namespace_unmount::plan::classify_line (cognitive 18): lilly_zfs_namespace_unmount::plan::classify_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, 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":"lilly/native/zfs-namespace-unmount/src/plan.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdca49e22d0ecd4d38e28e15928135e70e47eddc1b321d31ed9c50808c28a48"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent::managed_skills::materialize::parse_tree (cognitive 18): lyra::agent::managed_skills::materialize::parse_tree 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":"lyra/src/agent/managed_skills/materialize.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a77e5866c02a855b49af71e44868d1b27e87a37875325b7aeb1d74bfcde1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::native_guest::services_ready_in (cognitive 18): lyra::native_guest::services_ready_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/native_guest.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"539b1eda74ccb25dafd758394e0e71b5feb383df6636a1cc294d238d6aeb0345"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::update::work (cognitive 18): lyra::update::work has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 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":"lyra/src/update.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daafcd51ce8fc095652029986157374c6ef9585709d4052a694b36e0e5bbe69"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::views::build_deployments (cognitive 18): mila_native_linux::views::build_deployments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/views.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de89f032df57e5a8009428813209b7b9b6300946cd27a4b2a50240cab628d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_terminald::pty::spawn (cognitive 18): lilly_terminald::pty::spawn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 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":"nix/domains/artifacts/terminald/src/pty.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f5ed73702674f9a372ea7fbdda0183c5a83b3457a5c274a9e9811252c17c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_terminald::sys::pty::run_child (cognitive 18): lilly_terminald::sys::pty::run_child has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/sys/pty.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"573e1eea7cb334ee9c027497939199bf27a382170b07d63e1d57566e56ea445f"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipe::operation (cognitive 18): Pipe::operation has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows_pipe.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8e2120c5fb7a35da97b12f2e4d67c6d1ff5220772f80519032b7fa134ba22"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::linux_main::ensure_worker (cognitive 18): overalls_vscode_web_broker::linux_main::ensure_worker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b48e061799cd2a1e3e0ae27046e039e93cf539091d47070119f8f915e7397c"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::read_request (cognitive 18): overalls_otel_guest_receiver::read_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/main.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d270b23ae6d5ce2bd276aee2772e8e1663a6ac780e5dd67014eb649447a67b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pane.handleControl (cognitive 18): Pane.handleControl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (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":"marshall/assets/js/terminals.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3adabfdd792db1bf82b68411c00595ba9c57de2d8a22157d94e7d6dde1bcb3b"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build (cognitive 18): build.build has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marvin/scripts/build.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98362911805fd13ae2dc18de8bb932b654b83068f53e15b0ad698bab51186cc"}},{"ruleId":"D2","level":"warning","message":{"text":"retryOpening (cognitive 18): retryOpening has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 927, 926). 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":"marshall/assets/js/terminals.js"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"92404f6667a140382feef03f47afa21a870c14014ad3466baa749c18b5ecf6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"sectionReadiness (cognitive 18): sectionReadiness has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3, ternaries 3. Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, 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":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5290fe4bd0e1085811d2b4fd0a57005ec5686225015f3c6e32d75cbce5dcb7ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MainWindow.RefreshMachines (cognitive 17): MainWindow.RefreshMachines has cognitive complexity 17 (threshold 15). 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":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0222bf915786070110ddc761dd3c80f4a70a50c54438cfa34887afafc8741c"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestBoot.decode (cognitive 17): GuestBoot.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_boot.ex"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b744717b6775d89c5cc9182aee039552ad77b5c406c0d21df7c36d77967e7"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestExecutor.process_proof (cognitive 17): GuestExecutor.process_proof has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cb706f20fb9e5916a7da044f2ed632bc45e1bf4b92f934b97179e0ad457712"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestExecutor.decode_observation (cognitive 17): GuestExecutor.decode_observation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6b6b1b07723907948b29153c9b645c9c3ad9a822708773452bdc863b1fe34b"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.write_fault_request (cognitive 17): GuestWitness.write_fault_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19b87497491302de6b60117fc519811f1c68cdc94b735ad37ac020afe30fd04"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.decode (cognitive 17): Config.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, 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":"audi/lib/audi/config.ex"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7006d334ba2d789540b16f8bbaf85b68c14a5aae6eb4de2df87def48bc62fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot.decode (cognitive 17): Snapshot.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 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":"audi/lib/audi/dns/snapshot.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a1eeb579142e67575f4b91619b38e137717d93cfad82b8e3da90991689b4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientHello.records (cognitive 17): ClientHello.records has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (7 pts) (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":"audi/lib/audi/inception/client_hello.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0288fe267c11c128b8b63e6abb6f7f3bda0281201f9b6a88f24de8ef0916b05"}},{"ruleId":"D2","level":"warning","message":{"text":"Wake.wait (cognitive 17): Wake.wait has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (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":"audi/lib/audi/wake.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b746a5ad0a19170d678ded492fc955d8beba9af9abb5287522ffcfaca395ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"Aggregate.validate_duration (cognitive 17): Aggregate.validate_duration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, 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":"elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d065f8bfc46875ed1270da99ac73e97f30d9f6f6e3ee36a9e6716407b3996514"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.receive_commands (cognitive 17): Runtime.receive_commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), boolean chains 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":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b55ba1dabf4e6373c8272ae1af5d505defc1525b394c006715aadea52cbab07"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFS.child_mount_state (cognitive 17): ZFS.child_mount_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac83873ea6e8f691b030c2a4600723ff18bf1c5d8b1d38bbfd210728fc3e6686"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFS.classify_accounting (cognitive 17): ZFS.classify_accounting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4214762ea322f71722e6926786b829d7de60975b778b0381bee2bf93fa5274a"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFS.parse_status (cognitive 17): ZFS.parse_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"634ead62c0f8484631e70e544ec180758c5f62c8021434a80a4c931580981cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.resize_record (cognitive 17): ZFSDataset.resize_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bac84565f65fcc1195b7f7e3c7fc7127ee002271ffc05ef668be282937382d"}},{"ruleId":"D2","level":"warning","message":{"text":"Journal.write (cognitive 17): Journal.write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 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":"lilly/lib/lilly/lifecycle/journal.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"36101aa77913058570afea361cae2f7e2f1b5faacb9f126932643f8df4df45da"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.claim (cognitive 17): Network.claim has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dfe66801a631a8ee4e8636fbbe7bb13a7ffc4928535cca6b25682f602f87f9"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneCopy.durable_copy (cognitive 17): CloneCopy.durable_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (8 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":"lilly/lib/lilly/transfer/clone_copy.ex"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"051959e89f84cc7d981b998ba0de7979d2fa45a2c3d1c38658a039aa3afcfebf"}},{"ruleId":"D2","level":"warning","message":{"text":"CloneCopyJournal.read (cognitive 17): CloneCopyJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"462bac1845af289a1857c98497d493865d6203e287bc9d61cfc9c075161cb73d"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportJournal.read (cognitive 17): ImportJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (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":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cb760c5ee3b5a9e647da23dc5711808f8b9d43c58919415a3d287a4f8a4203"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceivedDataset.verify (cognitive 17): ReceivedDataset.verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"101db3caba8a9ddb92175ad85b1d2fff8e0c7ff6fbbfce182858f02ad2048bff"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotJournal.read (cognitive 17): SnapshotJournal.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (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":"lilly/lib/lilly/transfer/snapshot_journal.ex"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61300cda4e9f212444885954ee7d598e4911d06534fffd50b23d92dbe608e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotOwnership.placement_expectations (cognitive 17): SnapshotOwnership.placement_expectations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"lilly/lib/lilly/transfer/snapshot_ownership.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302e480e260bf3a2db8fe39b497269bd46ad12aa6cd796d701faf442f96df1e"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSnapshots.cleanup (cognitive 17): SourceSnapshots.cleanup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 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":"lilly/lib/lilly/transfer/source_snapshots.ex"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0870d57e50c6b1b0c54a03a161b7ce00070e2e7b4a0aa6f692e5ba26933e57"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor.handle_call (cognitive 17): Actor.handle_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 5, 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":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c31eb79c63c8eccaafd67fd10b091f5826a2ee6a5c881b56f6f9158c0dabc98"}},{"ruleId":"D2","level":"warning","message":{"text":"API.parse (cognitive 17): API.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 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":"lilly/lib/lilly/vm/api.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"95639566f50c61e0ca1ae813c18febe4368c09cdb9280ac41bdb79dd2e04c504"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.resolve_executable (cognitive 17): Config.resolve_executable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (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":"lilly/lib/lilly/vm/config.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"de883c6e7163fceba83019b85c9b8cff743b0d35fee8603aadca1572bccc16b4"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountLifecycle.perform (cognitive 17): AccountLifecycle.perform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 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":"marshall/lib/marshall/accounts/account_lifecycle.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815edc26d5272c9b0e4f0b47e5007158559021811965a8e0d37051ddca0048b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutorSession.transition (cognitive 17): ExecutorSession.transition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"213b969d130f5606f3e7518746f999e084bc35720a479b8a6c747fd8bca3766b"}},{"ruleId":"D2","level":"warning","message":{"text":"EnrollmentPreparation.prepare_file (cognitive 17): EnrollmentPreparation.prepare_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/enrollment_preparation.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b133382378fcb1a9ddcf8954e51563817db22c9048b9598a1f8c5b8ac83d7e09"}},{"ruleId":"D2","level":"warning","message":{"text":"Evacuations.control (cognitive 17): Evacuations.control 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":"marshall/lib/marshall/compute/evacuations.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e08bbd4c5db83c24e45c1b7b876f1134e75a90deab645b90e992522488781"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationProbes.accept! (cognitive 17): RelocationProbes.accept! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, 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":"marshall/lib/marshall/compute/relocation_probes.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a2d7282993fbb037904e58860677046e1de21fcf6be74075e00ebbc5e0ffe1"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationSources.accept! (cognitive 17): RelocationSources.accept! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, 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":"marshall/lib/marshall/compute/relocation_sources.ex"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0597cba6a72159ae041b5140260b9fc1ae8072636a179a29912d101a398da3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentPublications.exchange (cognitive 17): EnvironmentPublications.exchange has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6, match/switch 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":"marshall/lib/marshall/ingress/environment_publications.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"91958753b560ca6c1b3cceda741880f809209b80965fe698d230625d4d93ca4a"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivateFiles.with_new (cognitive 17): PrivateFiles.with_new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 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":"marshall/lib/marshall/operations/private_files.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"613c169592e64141afa2bac295f87cb1a61c84a536fcd60ae7fa911a65576b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer.attach (cognitive 17): Viewer.attach has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 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":"marshall/lib/marshall/terminal/viewer.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"95902be5c7321663da1cd0d5bb4693ccf1e91372b86f2b9eef3ba2ffbf7e6e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"InceptionParent.validate (cognitive 17): InceptionParent.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, 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":"protocol/lib/overalls_protocol/inception_parent.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a77e53c23f9902999b0be6d5c5490a94c9f532256b43eec628ffb859c2fbed7"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.pages (cognitive 17): Catalog.pages 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, 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":"ziggy/lib/ziggy/catalog.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab3fde26800b03f352c266b6fc2c0103d806c32c94bd35f071cb1e96b3a98b2"}},{"ruleId":"D2","level":"warning","message":{"text":"MilaFfiAdapterKt.parseMilaRoute (cognitive 17): MilaFfiAdapterKt.parseMilaRoute has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 6, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc629d27a92fc4a242e199d66c7ad9d593c8c1842966e67808d644f0737f30cf"}},{"ruleId":"D2","level":"warning","message":{"text":"physical_scenario.run_measured_physical_capacity (cognitive 17): physical_scenario.run_measured_physical_capacity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 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":"antithesis/workload/admission/physical_scenario.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"37997f1f689709497e4bf35a8374a533401078b0bccc4a410826882f8359dd30"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeLifecycleOperator._result (cognitive 17): ComputeLifecycleOperator._result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, error handling 2 (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":"antithesis/workload/guest_lifecycle/operation.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2c57666a577fa6b853cd210e26a1079a8f4ed9401f96f1064ccf53da0c932d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.main (cognitive 17): bridge.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 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":"antithesis/emulation/recorder/bridge.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aaee30216568e70041967b6b4b0b03d16f4243ec5b31a6cf900c2235315b44"}},{"ruleId":"D2","level":"warning","message":{"text":"witness_worker.validate (cognitive 17): witness_worker.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 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":"antithesis/integration/witness_worker.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f213c5b8234afe36585808f193ca135a1f73a004e8673c4a2a2c2bd32c621676"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_parity.compare_bytes (cognitive 17): rust_parity.compare_bytes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 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":"buck/rust_parity.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31bc678bf7bc366316f8941122074b4b246f8bd3ac18ec24285b20383634b75"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_catalogs.validate (cognitive 17): generate_catalogs.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (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":"mila/localization/generate_catalogs.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d003bdc75713bb087a3708c393717f2004216df75c35c089b53592105ba63131"}},{"ruleId":"D2","level":"warning","message":{"text":"control_worker.process_category (cognitive 17): control_worker.process_category has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 8, ternaries 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":"nix/domains/artifacts/guest/inception/control_worker.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9424cd9c15f7d27050a9c4e6cda07b6d1f7ac59198c9c3259b7e45074d577a"}},{"ruleId":"D2","level":"warning","message":{"text":"native_image.check_kit (cognitive 17): native_image.check_kit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad77215ae2d076425604e238e7f1c990a9782f2a4a5a037ff12f122d2513925"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.discover (cognitive 17): cli.discover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4, 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":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"da835da2bf961279da07fd6c3556c49625e0f262c7378d3070212a9e97abb572"}},{"ruleId":"D2","level":"warning","message":{"text":"enrollment.finish_completed_lilly_rebind (cognitive 17): enrollment.finish_completed_lilly_rebind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a01f4ceebff0fa0df0a544ac879cebb300c1ec47e56d97ea99ba923cc5f0687"}},{"ruleId":"D2","level":"warning","message":{"text":"remote.storage (cognitive 17): remote.storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5, boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/host/remote.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2d13d07985c10b3ff86223441d5ef8c68eeb7076896cb4dd56ca48ce193129"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCapture.release (cognitive 17): HostCapture.release has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/backups/host.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9e1fc9a9ea4368c75733a073f382f8dbb158e7129b37edbc076fcc35d5889a"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.write_record (cognitive 17): collector.write_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), ternaries 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":"nix/domains/system/firecracker-logging/collector.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"889bab37d9af3fa86d33c6adbe856d1c872f7e0368cd1bc0f8888a3d2e8f32ca"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal_metrics.decode (cognitive 17): terminal_metrics.decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1, ternaries 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":"nix/domains/system/fleet-exporter/terminal_metrics.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aabb339c3eabc4850f921da8d40623e66b963d21ee4ce14ec46be2972b10f8"}},{"ruleId":"D2","level":"warning","message":{"text":"health.settings (cognitive 17): health.settings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, 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":"nix/domains/system/logging/health.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62074c203abec05909d69ed882a41e223b4f517e2a027db8d7d88b5783783c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::run (cognitive 17): Session::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/session.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c16410333223f941d438aab6d932be774b8791b49933644ed891da426679b19"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::files::empty (cognitive 17): lilly_hostd::files::empty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/files.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"878fb6bab29a5a2f5bccb63bda22895893505338bf6c2c92a3b7001960307fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::sys::native::unprivileged_socket_status (cognitive 17): lyra::sys::native::unprivileged_socket_status 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":"lyra/src/sys/native.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c163b3e3bb987957d8d63dbdc55aa8c5f55c882110be1af4b9a1fe11d5f5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_runtime::push::parse_utc_timestamp (cognitive 17): mila_runtime::push::parse_utc_timestamp 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":"mila/rust/mila-runtime/src/push.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b4c8f0ec8824f369fd59c037ea693be98a6571c00de8b85343b56ed1c5d975"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::windows_main::ensure_worker (cognitive 17): overalls_vscode_web_broker::windows_main::ensure_worker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 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":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3299601b0186307507cb2e10014f41ce01a7a710cf51ec1588366c6de194511"}},{"ruleId":"D2","level":"warning","message":{"text":"probe.presentation (cognitive 17): probe.presentation has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, ternaries 5. Of this number, 11 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3443d40b4a03f7d39ceed5cfb0a301a2fa21fa8e7583cb01d031fcdbfe8971a2"}},{"ruleId":"D2","level":"warning","message":{"text":"t (cognitive 17): t has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 8). 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, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/localization.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510b37a500c4737f87c9fa42beaa4037c71e3fd13a92ccd38132d6fbd32e456"}},{"ruleId":"D2","level":"warning","message":{"text":"select (cognitive 17): select has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 4). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc7dcdf4721cc72ba315f1f5fa969d3d673c614b61590c58c6ca48464dfbc30"}},{"ruleId":"D2","level":"warning","message":{"text":"getRecentRuns (cognitive 17): getRecentRuns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/antithesis-agent-browser/assets/antithesis-agent-browser.js"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba647f01f5fae68bc702619470c01c338b42c9bf7c4bbdf10412d8eccdfba77d"}},{"ruleId":"D2","level":"warning","message":{"text":"buildQuery (cognitive 17): buildQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cf53034a51fd327739cf58cf0d95a09a97ad0d3aa716a8dca089dc8c18f92d"}},{"ruleId":"D2","level":"warning","message":{"text":"readResults (cognitive 17): readResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":".agents/skills/antithesis-query-logs/assets/antithesis-query-logs.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69495b3bb7b2e16721ed2e01d7eb1fe6dda7ef7049f7b7472e2409510b809e9"}},{"ruleId":"D2","level":"warning","message":{"text":"preflightJsonText::beginValue (cognitive 17): preflightJsonText::beginValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3125d5dd8d41aded087528ef6183b9e15853779e2c84fc3de56bc5c3c8b17a27"}},{"ruleId":"D2","level":"warning","message":{"text":"validateReviewedPathOwnership (cognitive 17): validateReviewedPathOwnership has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a836f62da11c61924df73fd63b8fa3408514e6d89fa6b1e6f6b2f53e7cf49d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"LifecycleSmoke.DeploymentPickerController (cognitive 16): LifecycleSmoke.DeploymentPickerController has cognitive 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":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae639864a9d1c80ffbe9595f53eb5e80a3f6ccfa5e5f75c0e21f6aedfe547dee"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestExecutor.start (cognitive 16): GuestExecutor.start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e689cf7a7001ddbb8c1b106bd1f86e233a481d5518ced1d538c7dce043e66aef"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestWitness.sanitize (cognitive 16): GuestWitness.sanitize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e66c6681634647ad5b0f7ec8b045f0c42ec6923e73ba6d60ca88ac674986c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.tls (cognitive 16): Config.tls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"audi/lib/audi/config.ex"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2e9423256725a838ec949386f6212a9943c69d79fdc58e35e0b9264893fc80"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot.records (cognitive 16): Snapshot.records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, 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":"audi/lib/audi/dns/snapshot.ex"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"720492b379190129506be3a332b41c948bed5d79f61d1ac82fa3af5818b17274"}},{"ruleId":"D2","level":"warning","message":{"text":"Front.handle_connection (cognitive 16): Front.handle_connection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (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":"audi/lib/audi/inception/front.ex"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa35b6d8424a5939109fb0a9ba8c898187c02b1c1512b9033f524f64f265b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Front.upload (cognitive 16): Front.upload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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":"audi/lib/audi/private/front.ex"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0362f66da48b53f6b80352498a044ec24266f920b5315108fc025d0432afd401"}},{"ruleId":"D2","level":"warning","message":{"text":"Pressure.read (cognitive 16): Pressure.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"brady/lib/brady/cache/pressure.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0cdf0f8614feda1e2ce7b90f53ae4136daa0babc99f0071e253e2e78fb9077"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection.https (cognitive 16): Connection.https has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (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":"brady/lib/brady/connection.ex"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3652f10d4b9d43bdee5775d94f25a179cc51ea1eb1ee1bd09159aca1b118c561"}},{"ruleId":"D2","level":"warning","message":{"text":"Metrics.handle_info (cognitive 16): Metrics.handle_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/metrics.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdd2030f7ffbbc848b1b9007fb372302a47ef1b9685993fa9aa93caeeda9377"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.load (cognitive 16): Config.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, 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":"enrico/lib/enrico/config.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fa717f7af001b957fdf7638df697e8ad47bc952e7eda11bb6e6add630c41c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Upstream.forward_pulled (cognitive 16): Upstream.forward_pulled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 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":"galileo/lib/galileo/upstream.ex"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6f2fda4390ef29c1f1307a6c69a0bf0cf4d2f11704ea3d0363001cea12f534"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.exchange_relocation_probe (cognitive 16): Client.exchange_relocation_probe 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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0ba6847078488e4404a5fe3df1347bd3f85f3ad5e0b3bb90a4192ea3e5bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupSnapshot.create (cognitive 16): BackupSnapshot.create 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":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac993e196b09ec4fb92cf280e5dab58c9caace99e85438188ee6e19b436b708"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTemplate.records (cognitive 16): ImageTemplate.records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130549d93f4b72d454d648a88b269082efd9e8515035da40a67627bdf490c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Limits.read (cognitive 16): Limits.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), 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":"lilly/lib/lilly/host/limits.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da93b9f494f2ff53fd235788c3d22da2d55954cf3b025c2ee3d118079547f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.cleanup_claim (cognitive 16): ZFSDataset.cleanup_claim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab78771785f093c27ce16c9809b772945871f78552f3424c080bb9dc9bdb15"}},{"ruleId":"D2","level":"warning","message":{"text":"ZFSDataset.audit_child (cognitive 16): ZFSDataset.audit_child has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ca22563c38744939d32efbaca26fb3c4b3862e0cd28935eff0063fc0fa1c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupHistory.expire (cognitive 16): BackupHistory.expire has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 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":"lilly/lib/lilly/lifecycle/backup_history.ex"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145aff7e46ce8d972dc668bc92ad7ac37687e0438c0e4f680b7f97f7156d49b"}},{"ruleId":"D2","level":"warning","message":{"text":"Journal.load (cognitive 16): Journal.load 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":"lilly/lib/lilly/lifecycle/journal.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9230ced351192250d27666da1de56b325c65330ac15d70c4dff1cedaabdbde6"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.guest_claim (cognitive 16): Network.guest_claim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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":"lilly/lib/lilly/network.ex"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b6aa7c475291b0d16a1918d57316766da64a976c8e0502bed1a92c463a4d45"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointTransfer.finish (cognitive 16): CheckpointTransfer.finish 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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815f12fc5a59fe56ef43ae65b8c2dbd2054d2fa2a2b9a4f74c329539cb4712f"}},{"ruleId":"D2","level":"warning","message":{"text":"Key.connection (cognitive 16): Key.connection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 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":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d944801c571dffb95c4540e3b7e8037047e10bbe2e27a1da1f72fcd096ed1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceivedDataset.resume_token (cognitive 16): ReceivedDataset.resume_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c581e3250c5ef16eacbc92ebb6fff041be6c1504d28151fc9e83f3575f3617f2"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStorage.retire (cognitive 16): CheckpointStorage.retire has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8b94663720e417718ecb2c68f27a36867af15c6d72062a6c0b13bb84304d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.retire_transfer_source (cognitive 16): Driver.retire_transfer_source 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cad5c9b222f2f1b67c45c12db0bd4003a948e0397f9403e711e11e0724c20c"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.skip_trust (cognitive 16): Driver.skip_trust has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7e8c94455c12efd1ca4c45a2bf766820abecae0fbcf98738a4d2fd48d04b32"}},{"ruleId":"D2","level":"warning","message":{"text":"Jail.prepare (cognitive 16): Jail.prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 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":"lilly/lib/lilly/vm/jail.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a143080bb66ac0bd8b049465dcb4edcf54acbbed58916892a16e4bfcaa3ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.collect_inventory! (cognitive 16): Context.collect_inventory! has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7334c34bf30b3c5ce5ceb33244ca3249f13b19f05d430aa119f26dc52468c123"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutorSession.register (cognitive 16): ExecutorSession.register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, 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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f142da9f08b3caf12950bc16ab4ee3bd828cd086768e2684ac53b4df6e8b80"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerToolJob.finish (cognitive 16): ServerToolJob.finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (6 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":"marshall/lib/marshall/agents/server_tool_job.ex"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e5295b1cf9d549286e9467e1a098cdadb3bafc77afcef8918acbd13115545e"}},{"ruleId":"D2","level":"warning","message":{"text":"Skills.verify_result (cognitive 16): Skills.verify_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, 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":"marshall/lib/marshall/agents/skills.ex"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a02ee78a6e93f928162697d1212cb9990abe5795abfe660e2e244a4de5d65b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Sharing.apply_change! (cognitive 16): Sharing.apply_change! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 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":"marshall/lib/marshall/artifacts/sharing.ex"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17ac2a99c8ea93daccb8d4ae11db77780e66b53bd625e89fb0ad74be5d0fa7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Admission.run (cognitive 16): Admission.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 2 (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":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db882749d76d1f34b9bd885790ac094a59cea1a51e998da4e87f15e81e672b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Drains.close (cognitive 16): Drains.close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 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":"marshall/lib/marshall/compute/drains.ex"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bbc1076078d14297985fb295afe9f74662104d1967e106c8fe6342e5b83bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifecycle.resume_for_scim (cognitive 16): Lifecycle.resume_for_scim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (7 pts), boolean chains 2 (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":"marshall/lib/marshall/compute/lifecycle.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6976dd77207ccd1865ed5bcab4f1cdbbd04519b7b1e8b152d61e6c55a7fa021"}},{"ruleId":"D2","level":"warning","message":{"text":"LifecycleHistory.run (cognitive 16): LifecycleHistory.run 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":"marshall/lib/marshall/compute/lifecycle_history.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65ec6d697ee52cadfc802cd94bdbff716d507ddc371a8e1c03417ccaac6686e"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationCleanup.deletion_confirmed? (cognitive 16): RelocationCleanup.deletion_confirmed? has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1e7d100c2056af01b1cb49760a39718de2cdd611797d39401a3e6eddf7375"}},{"ruleId":"D2","level":"warning","message":{"text":"RelocationStatus.downtime (cognitive 16): RelocationStatus.downtime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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":"marshall/lib/marshall/compute/relocation_status.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e262355654d0f6e807eb949fc41895cd01cee33e54d521afa35ecbed742693"}},{"ruleId":"D2","level":"warning","message":{"text":"RestartCapacity.physical_capacity (cognitive 16): RestartCapacity.physical_capacity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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":"marshall/lib/marshall/compute/restart_capacity.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f135c33d60efd167ab53cd840bdd4d540854a7b77923775f3dd31ba52df3ceba"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHub.validate_refresh (cognitive 16): GitHub.validate_refresh 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":"marshall/lib/marshall/github.ex"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497cafe4ea25030119e9a10b7144cfe89c10f4691a1d3e912740da5b6c26bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Credentials.ensure (cognitive 16): Credentials.ensure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 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":"marshall/lib/marshall/inference/credentials.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c6b63a00ba5c2f5fadb9484d783146fad227ba3abb3fc0e17ca38a1db5fdac"}},{"ruleId":"D2","level":"warning","message":{"text":"Requests.authorize_update (cognitive 16): Requests.authorize_update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/inference/requests.ex"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fddb3d5e224ef5dd4fa6ef5216e2a1f7c6b3fc4b78a67d55ed83c74f4effe09"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.discover! (cognitive 16): Execution.discover! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 15, if/else 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":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a77f5760cb7b3130a0e335c289593c30fe0c4052261dfbec02be20b08bbfe0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Relays.connection! (cognitive 16): Relays.connection! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, match/switch 1 (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":"marshall/lib/marshall/ingress/relays.ex"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"27feee99028da4d9ac8be5041c8c36cde85531195963418d9be33745b889a7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.remote (cognitive 16): Config.remote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 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":"marshall/lib/marshall/mailer/config.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24532ca1bff38198e357524a0a9760abe4ee2a9f53a801a834aa04bc88c1e74"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageBoards.authorize_post (cognitive 16): MessageBoards.authorize_post has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, match/switch 4 (6 pts), boolean chains 4 (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":"marshall/lib/marshall/message_boards.ex"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e05eb9c95b7cd0dee6774a848ebf6f5398006cd330ff963e0c2b3f8f22dd4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeConfig.database (cognitive 16): RuntimeConfig.database has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, 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":"marshall/lib/marshall/operations/runtime_config.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ee84dd473a5ba86fd897c0f46e9a1c73c2fad40747939aad1e0ecaf3f88939"}},{"ruleId":"D2","level":"warning","message":{"text":"MachinesLive.load (cognitive 16): MachinesLive.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 4 (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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c6856fcafd630c86f1a076ce37ba32d9ddca4f6f637a12a1b9e64ce4ef356f"}},{"ruleId":"D2","level":"warning","message":{"text":"Pricing.token_cost (cognitive 16): Pricing.token_cost has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, 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":"ziggy/lib/ziggy/pricing.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4329c122d92dc8af317453ebe933be723694531fd0ee1384bd34475c86ff785"}},{"ruleId":"D2","level":"warning","message":{"text":"credential.read_lilly_credential (cognitive 16): credential.read_lilly_credential has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 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":"antithesis/workload/control/credential.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d228de5873a5d6563b93893254d3ef8b0e5de56dfde1d52f92ecc38c866bf0b"}},{"ruleId":"D2","level":"warning","message":{"text":"profile_readiness.repository_origin_ready (cognitive 16): profile_readiness.repository_origin_ready has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 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":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6718ff3d9eb2487c9cb4f7b2d83f4ab54f33bc1e1102437d1bc66000cf2a98"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.dispatch (cognitive 16): bridge.dispatch has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. 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":"antithesis/emulation/recorder/bridge.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8e223632e72228ac34c485eb2768c6351a6841efd8d733cc8450ac7e420942"}},{"ruleId":"D2","level":"warning","message":{"text":"authority.issue (cognitive 16): authority.issue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/priv/private_pki/authority.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"289caca02f3b4c0be43bdc112dda4356961e1174a6b60e9163bb600ad8a6d310"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_windows_dll.check_abi (cognitive 16): mila_windows_dll.check_abi has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (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":"buck/mila_windows_dll.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b46259be4e6d3312a03dc6f4e2013c80eaeaf2edc03260753286660a381c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"packaged_instrumentation.run_bounded (cognitive 16): packaged_instrumentation.run_bounded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), error handling 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef481343a04444d9fd0d9e56255775b614a93da93537f982f4e3f58a07d1309"}},{"ruleId":"D2","level":"warning","message":{"text":"ingress.public_environment (cognitive 16): ingress.public_environment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (4 pts), ternaries 3 (4 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":"nix/domains/artifacts/guest/inception/ingress.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c0ff156d9fd52479f420ebcf65afb96b597bcd6a15b4bc0b11b1b1349ce7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"enrollment.main (cognitive 16): enrollment.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 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":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc9a13f2fcc0bea201277449388ab82bb47638c0928a7c7ddebb22afd3396b"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reconcile (cognitive 16): cli.reconcile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, loops 3, 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":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4e34b9034e02fc85e3b8d1aeafed331f328b8bc7a3ba05bbbdf18906ebf3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository.retain (cognitive 16): Repository.retain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, 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":"nix/domains/system/backups/restic.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0458607f0180a19b1eabb5083341090a9288cdd25cf5d8edcd6d3b983b44415"}},{"ruleId":"D2","level":"warning","message":{"text":"browser_journey.load_fixture (cognitive 16): browser_journey.load_fixture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/browser_journey.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fb6b7d4558d59953b4954f47be16c4b1f5cec429755c52e47862cb9f98ec3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadDetailView.body (cognitive 16): ThreadDetailView.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6e70871d2770a550dd757db0d968ae632886dd9ab5363f43212827ee78b2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::exec::child::pin (cognitive 16): lilly_hostd::exec::child::pin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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":"lilly/native/hostd/src/exec.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec2a2618674439c233e415bd0a66a52153bf6a045893ffc1b4854ab6d742f6"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_hostd::mounts::perform (cognitive 16): lilly_hostd::mounts::perform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (4 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":"lilly/native/hostd/src/mounts.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0c9ca69820c28d52e899e79946fed73ffc20d0684bdca524627597889f91a5"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_resume_token::lineage::matches (cognitive 16): lilly_resume_token::lineage::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 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":"lilly/native/resume-token/src/lineage.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad72a67eacc1e80c7aadc61834a6661868dfcc9f5d58723b77b32e52ba9ba92"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_source_export::run::run (cognitive 16): lilly_source_export::run::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 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":"lilly/native/source-export/src/run.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1abed2ff93b9c3e5de2eb56e3f176c7eb6daf9e1319ff99e749db89dbfefb3"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::agent_cli::run (cognitive 16): lyra::agent_cli::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2, match/switch 1 (2 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":"lyra/src/agent_cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cab54e4eb2cebb24db5dbab5e24500e0bcc8eb54b641f6e76bbd47db86177e"}},{"ruleId":"D2","level":"warning","message":{"text":"lyra::native_bootstrap::output (cognitive 16): lyra::native_bootstrap::output 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":"lyra/src/native_bootstrap.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a5d5feed04d0b965cfe3e923b4bc71a2b15e831008aa90f5bc2496ff1e8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveSession::thread_action (cognitive 16): LiveSession::thread_action 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14135ea4954498be5731d1d50791877c68a967113cf3fcf1472bc7e2aaf9618"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::journey::sign_in (cognitive 16): mila_native_linux::journey::sign_in has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17babbeb993ad15fcfdc12caa34b1ef53d05b9e5b9465808367330f087b253"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_native_linux::journey::run_guest_terminal (cognitive 16): mila_native_linux::journey::run_guest_terminal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 2, boolean chains 1, loops 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b4571625c48bef9de8fdbf00d4f28b132bbd9a724af7adbdce154eb4b09f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mila_ffi::commands::mila_session_command_format (cognitive 16): mila_ffi::commands::mila_session_command_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/commands.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c50d7b18fe99fe1f78a7c095003c30033943b501cfd33749a1339e63b4a5cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"AppLock::apply (cognitive 16): AppLock::apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, 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":"mila/rust/mila-runtime/src/lock.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4e8e88b3cd175eb00b320250557b4455a0187489e5805e68b8489d538a7697"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchSession::read_within (cognitive 16): WatchSession::read_within has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 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":"mila/rust/mila-transport/src/watch_channel.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aab991e9222e5ae315d02ff71bc07650994e6c4f01f3518c1205c6400de1aec"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon::attach (cognitive 16): Daemon::attach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2140c34030408a4fa4aab595b75cf94850d79ffb282c674162168287ff3688"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon::writer_loop (cognitive 16): Daemon::writer_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dee17b15aa535e20a33e2b24cd161e030da4a89f61a45dd159c3ca1f1177469"}},{"ruleId":"D2","level":"warning","message":{"text":"lilly_terminald::observer::handle (cognitive 16): lilly_terminald::observer::handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 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":"nix/domains/artifacts/terminald/src/observer.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c682d427326cc55b1b68ef435cae21c2af9e39871e83110985552dc9427cfc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Journal::publish_with_group (cognitive 16): Journal::publish_with_group 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":"nix/domains/artifacts/underclass/slo.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9accf7c5a92fe355f852ff7ce350559c36c8dacc3addc537914782203b7bebbe"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::mmds::exchange (cognitive 16): overalls_vscode_web_broker::mmds::exchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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":"nix/domains/artifacts/vscode-web-broker/src/mmds.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"414f47627198e5c030aee222603e20d814242aec45ffb2c7d31bf48352681dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_vscode_web_broker::windows_model::command_line (cognitive 16): overalls_vscode_web_broker::windows_model::command_line 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":"nix/domains/artifacts/vscode-web-broker/src/windows_model.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef5a1eba4a04634e89400345efa7ee52452b1dccbe7dc95f07cedf87abbbed6"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::open (cognitive 16): Store::open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (4 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":"nix/domains/system/otel-guest/receiver/src/durable_slo.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c282e5a2808720eb60410ea6fcd9265fd6818d95c30b286836b6297e2c5648"}},{"ruleId":"D2","level":"warning","message":{"text":"overalls_otel_guest_receiver::underclass_probe::valid_response (cognitive 16): overalls_otel_guest_receiver::underclass_probe::valid_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/underclass_probe.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0c98d2db0db263b188222edb04efbfe824a79a8a533f113e546c59e8c408b9"}},{"ruleId":"D2","level":"warning","message":{"text":"canonicalKey (cognitive 16): canonicalKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (4 pts) (nesting depth added 4). None of this is in the body itself: all 16 points belong to 4 function items inside it that branch (encode, append, a function literal at line 184, \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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b539ba60f82b7fe11dcd48852895aad340b5a77433fe7d5a31428268602f397"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/threads_live.ex: FileTooLong \u2014 2841 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 72 functions. The bar is 500 significant lines; this is 2341 over it, 5.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":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b39983d367eb6e64d25366802a9df625c6ad0415261b20ed61c45f10f64a294"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::pages::build_machines: FunctionTooLong \u2014 mila_native_linux::pages::build_machines runs 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 411 over it, 5.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":"mila/native/linux/src/pages.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"44529d44ae68f53220d8887bc1d909e1eec576336ebb5d4a240e4107d5c3ee4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RustNative: TooManyMethods \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded), 119 methods, declared across 3 files: Interop/RustNative.cs (77), Interop/RustNativeLifecycle.cs (34), Interop/WatchStream.cs (8). The bar is 30 methods; this is 89 over it, 3.97\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba40d0dbc1bdf6a01369f90c6a0dca3441b53eaa8c866235a8a1311045ae40eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/driver.ex: FileTooLong \u2014 1774 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 117 functions. The bar is 500 significant lines; this is 1274 over it, 3.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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab76b7a79af3e602de2e529e50ca0408102c4166ce9d97805b5a653beedea03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MilaRustFfi: TooManyMethods \u2014 106 methods. The bar is 30 methods; this is 76 over it, 3.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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec67fe0e262c27d61c8aaafdaa59f571b79849e2df26a206b2ec0f31494b1c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MainWindow: TooManyMethods \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded), 93 methods. The bar is 30 methods; this is 63 over it, 3.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":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a7124f0650aa8b3f97035df0c4269f1a22d58a852bf8c5cf833723bf2a8f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::gtk_journey::page_steps: FunctionTooLong \u2014 mila_native_linux::gtk_journey::page_steps runs 298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 198 over it, 2.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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54e9906e60d99e4880838d263d638c399b675f1b99ad5e19a1940d678dde3d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Script.step: MethodTooLong \u2014 step 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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae37f9e312cc379e488e3b253160e983a349e2c3a0768d6b29fe863a0942f89a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control/runtime.ex: FileTooLong \u2014 1383 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 74 functions. The bar is 500 significant lines; this is 883 over it, 2.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":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"455c2b2006c85d442f3b470fa1efa70f42208bf0ce537883b88ab0c84615a3c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gtk_journey.rs: FileTooLong \u2014 1369 significant lines (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 869 over it, 2.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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4143991b2a02286cf6bf70dae3f74f405bb9095a20ba367de36703cb07696041"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/machines_live.ex: FileTooLong \u2014 1365 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 865 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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edc11ba83be21bfde50c6ee8e41b5d4a9b9f36ddd8a113a9f1bae1e38ba7c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/zfs_dataset.ex: FileTooLong \u2014 1332 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 95 functions. 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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8091b2402c05ec6504956b4da2997fc75808353e4fe5591153a34c45940bba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 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), declaring 56 free functions. The bar is 500 significant lines; this is 814 over it, 2.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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914a4c36387a9886cdfbe8e0da1c5d6ce971a5f725654415983a86f85daf3e28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::views::build_terminal: FunctionTooLong \u2014 mila_native_linux::views::build_terminal 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":"mila/native/linux/src/views.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f3166474f3778200e409a508ae1560909ace1cef9e3d6185aa3fbddc543a72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeState.ensure_window: MethodTooLong \u2014 ensure_window 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":"mila/native/linux/src/main.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a49a818d120835da82f40bfa64ab43b57bedf7edc81b316d57fd0f41d73665d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/journey.rs: FileTooLong \u2014 1188 significant lines (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 688 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bbf582880dd1277c8d0004cec890bf156c80dcf112fb4496555b4b70d2fe65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: auto-update/runtime.py: FileTooLong \u2014 1144 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 644 over it, 2.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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cec4b65f7c0e15a7a2d4f4a9de9bbf4f70d2580ae7acae37e587845ab8b000"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ssh/commands.ex: FileTooLong \u2014 1139 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 50 functions. The bar is 500 significant lines; this is 639 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":"marshall/lib/marshall/ssh/commands.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6f32ec6404a02c7de3fceacabb727513876452b2b179b58140a27d703d890a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Driver.authenticated: MethodTooLong \u2014 authenticated 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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d6dc44770e33b47bdf657bdbaa5a6eaee51ff26d8815484f0f4bb7390c74ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::pages::build_threads: FunctionTooLong \u2014 mila_native_linux::pages::build_threads 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":"mila/native/linux/src/pages.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ed93560d147867405d7ba3d73c45165b5ce3a833f5ae08cb4f94655e77b32e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: guest/server.py: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 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":"antithesis/emulation/guest/server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b4d98695ae9a0929f229fd91af67d5636ebd09ca933e780eaf76fbdc7ec6e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/zfs.ex: FileTooLong \u2014 1036 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 69 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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"945ca007ba4d78c1b8bf08f96da68b6c80ffedfb53064b1de9f475a3091fd581"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: marshall/github.ex: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 59 functions. The bar is 500 significant lines; this is 534 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":"marshall/lib/marshall/github.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1612ef67fb23f80a4e902d000022423958066aafb12f172a750fc8b7db60833"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.Main: MethodTooLong \u2014 Main runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.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":"mila/windows-dotnet-smoke/Program.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb97d3c04d77f76f5111ed38535cbc2e681662b55e7fd21a966b38302df33885"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::journey::run_pages: FunctionTooLong \u2014 mila_native_linux::journey::run_pages 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c9c284e1318b440c206c515de379590ce97b2e325877418168c1d9a8efdc40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: marshall/events.ex: FileTooLong \u2014 978 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 478 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":"marshall/lib/marshall/events.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c26e5447bfa099b14ce2a1c87a9a640541aedfa6cc1ed858f9f6b5ea1b88da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/monospace_browser_probe.py: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 476 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":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3adb93a619b60a1ee3d88bb235cdd6f8e76ef071f1ac7df8bc6849e75cb1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::journey::run: FunctionTooLong \u2014 mila_native_linux::journey::run 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":"mila/native/linux/src/journey.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3012667b351904d983b4aa1d289e128fd08d47934437e0657ab85208172a1676"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verification/identity.py: FileTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 442 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":"antithesis/verification/identity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537cf0c33bd5cc1a6967f69eab7d2d43270ef6d77699c63e874c368a63c3afd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/views.rs: FileTooLong \u2014 931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 431 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":"mila/native/linux/src/views.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9bc16b9920b2d57cd984b25d4be10e47c04b1ff80c8951423a6fc2d9a4d46c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_hostd::transfer::plan: FunctionTooLong \u2014 lilly_hostd::transfer::plan 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":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99df425be7a56bc0cf24872d608feafea96e551f61e9f8ae29c798e72b490d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 924 significant 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: Daemon (2 blocks, 154-1069). The bar is 500 significant lines; this is 424 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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2f1961d703fbda459cb47eea2e4be42046631539a79854c7b40bb4622ec135"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows-dotnet/MainWindow.xaml.cs: FileTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 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":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd1bba361d91780692f8844a634b91f9d24362a6ccbf10df7fa391d3dd040d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pages.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 387 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":"mila/native/linux/src/pages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7c43d2d7fe2a90d7c57e1ceefda1932035d47bc6561e2881b18a22d8ca78af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/terminals.js: FileTooLong \u2014 866 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 366 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":"marshall/assets/js/terminals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"944d318d8cd736f862b8bb5deffce60d7b70eea6e353506e8de2a1ce2ac46f56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/account_live.ex: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0671a5425d4088331cf94bd0c271d25c4304335edeb16f943911b0016f928057"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkedMilaFfiAdapter: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. Most of these members implement nativeui.MilaFfiAdapter (36 of 47 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4ffb2b97c957a5f4d7694c9d064c5128fd186aefff4cbbb484c0b1c97e3bc0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkedMilaFFIAdapter: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. Most of these members implement mila~native~apple~MilaNativeUI.MilaFFIAdapter (31 of 45 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1678ac1bbe7c7051f019900166d582ac436664003048b2e3d54624ecee23e7b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/maintenance.rs: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 308 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":"lyra/src/agent/maintenance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53b07e81f963654f6666b155b4eae3a7ca442fae26548ae1efa724ca8ff0ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: Session (2 blocks, 127-1180). The bar is 500 significant lines; this is 297 over it, 1.59\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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"599ed852518f7b48b46e5c61834b34ae92ea0ef0a7e40b0d02f5e4fc18da0fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: admin/lilly_nodes_live.ex: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2b22519df409aa698c327d96a17f978bf97d1c9407305af7caff95c2cb45cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.open: MethodTooLong \u2014 open 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":"elixir/diagnostics/native/spool/src/store.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"812c2f1e9562891c83d76f786cca2a39a5eba6c9c6d93fbcc3084e7f320c785c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Daemon: ClassTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 154-1069. The bar is 400 significant lines; this is 230 over it, 1.58\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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1381aece7b9a2aefebbf455d954a395c4db623ac025651c829e4eb91743c3ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \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), 16 methods, 2 blocks, lines 127-1180. The bar is 400 significant lines; this is 224 over it, 1.56\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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1864b5ba0c5556e5db74c6fb25bf72cb889615cf2f7cba2ad05a5d778b983fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.handle: MethodTooLong \u2014 handle 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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ef808f591fafb74336cc5a1626b76a9c00d5a27a825bad5e3027dc113b30b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiveSession.subscribe: MethodTooLong \u2014 subscribe 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":"mila/native/linux/src/session/watch.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"41456c89ef3d8b217bfe5ad9ce84aa67e970b53720747c41cbe66db90a5d9afc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control/client.ex: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b1269fce6dfe14af8f9e9dff1f573d8704f4ddde25db9040f419c57862ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MilaLiveSession: TooManyMethods \u2014 46 methods. The bar is 30 methods; 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":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3addde88f4f48fd8b1d0ada3280204715a086a2524e141ac0242219d687c39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 761 significant 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 71% of them inside a single declaration: Driver (2 blocks, 238-996). The bar is 500 significant lines; this is 261 over it, 1.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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde32a650ea3fc43b723f45343cbc43c72a6c4bf8930b7f115fc6f90e98e41d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_protocol::grammar::validate_command: FunctionTooLong \u2014 mila_protocol::grammar::validate_command 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":"mila/rust/mila-protocol/src/grammar.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"62487b98763ef8511362ea8a89f9f068c831496dd14ccdfd647ce333ed489e08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: probe.advance: FunctionTooLong \u2014 advance runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4786cc3f5afa99b5cddfbcb057d1260a4084a9b9e1c7716cb8e0166268cac89f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operator/guest_witness.ex: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd320b5be1f7ccc619cf03d423871619694126e0d404d90993953faedcda5a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/linux_main.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). The bar is 500 significant lines; this is 240 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":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eafb2c0c13582390b05b0ec49b9d9d10cf9d8e9eb07f16b80a703dfdbef6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_hostd::protocol::encode_request: FunctionTooLong \u2014 lilly_hostd::protocol::encode_request 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":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1357c4ac46bc1bed6a60a329af6734cd6728d344bd55b1932ec6bb6aabb7f5d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MilaSessionHandle: TooManyMethods \u2014 44 methods. The bar is 30 methods; 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4054a853ec50cb17b2d789e87b714cf9825a97d3543c81dd77d3399551dd715d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: guest/runner.py: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 232 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e87c1b547230eda2ad9de55d93f0e294a2979b55e1b1d7852f3b3d3f52f429"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/stream.ex: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 221 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":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03650469b9de212997c9b6d65780c09a406ac7c0339a9cc1e26100aac1dbac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/cli.py: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18b0d62c156380a09f1700b432d09df95fc262875c9bca08f46a00ce18543ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/hostd.ex: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 38 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":"lilly/lib/lilly/host/hostd.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1719c4ecf8ac0d236315f6a7ebaac44f1fddc81886b4aec489159c0445a45019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nativeui/MilaFfiAdapter.kt: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca5d454a8fdff074b00d4dc2cc53466916b8a783fb6432cee14de6fd09d623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vscode-web/extensions.py: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 200 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":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77041ac1dc2c08f453a6e3d55a8cff8c45cca4829f31a1564d32eeda03c8b48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control/client.ex: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 45 functions. 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":"audi/lib/audi/control/client.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9806ed27941cdb634e78ded62dad4c8c0b82305c22fcb030f4507fa7b84ac6e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: illumos/native_image.py: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/native-kernels/illumos/native_image.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b9caeaf79648da1e2370bd2d455ade320d831f3ccec06b1bf92f6f3b0e305"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/actor.ex: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 50 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":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d595f2192b54932335f87d59def86d3e3caa80322169824581e35fa0f38ebf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Interop/RustNative.cs: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 193 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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4c7d650adbde949ff7d3452b528f8c6f913f2c2b00d7af8d2d0c99fce0f90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/image_template.ex: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 54 functions. The bar is 500 significant lines; this is 188 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":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7aa2bc2c8990ba1582e3dd6e6e467c7b1195f15017938c753cb689c2891bb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/smoke_execution.exs: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 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":"marshall/scripts/smoke_execution.exs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3658a750160e58bc816068e7a7a0fe4495fef37d8f116fe70830ca1e7905ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verification/selection.py: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 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":"antithesis/verification/selection.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd0f5d3244b36c9ecc413f825bed6a0407dc0ac8a21c438c80484b2db71471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/adapter.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":"mila/native/linux/src/adapter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a0ec43e466f63c55634afb263e727ee7350f33b0e4b6b1f876ce43ebdb814e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/terminal_live.ex: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 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":"marshall/lib/marshall_web/live/terminal_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8190e5d4e7c25880c3defb871284ad1ffa8e8c8299d4c9209c35974678e249e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Driver: ClassTooLong \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), 15 methods, 2 blocks, lines 238-996. The bar is 400 significant lines; this is 141 over it, 1.35\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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d95973ff3374a914a5c393d145d93c2a45ead027546ff7447a426a4000eb096"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nativeui/MilaNativeUi.kt: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d735e1675b0a006c9c5da553c858d0f16a39a51dbdbb203505740e9a92fe2a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Script: ClassTooLong \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), 11 methods, 2 blocks, lines 1075-1814. The bar is 400 significant lines; this is 136 over it, 1.34\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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88a9d663f3138434260c084ee24acd3f3f91e7a95904b44b702a3f2ca241663"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LiveSession: TooManyMethods \u2014 40 methods, declared across 5 files: session/commands.rs (18), session/connection.rs (10), session/pty.rs (10), session/mod.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 10 over it, 1.33\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":"mila/native/linux/src/session/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5786eef94e624ca219da82b2e65420d15730be54437f6bcd711a9572754941"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/model_calls.ex: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8761598e517c9116663f4daaee1922b3141c678ce045e6786634afba352348"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LifecycleSmoke: ClassTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 127 over it, 1.32\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a353ba44bc2ed5b8184a43949cca49d988492e3603684fbef62c8d5ef594b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: MilaNativeUI/MilaNativeUI.swift: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dd1c856a832790dca818c6eebf3752f4e02c40ca257be9e51949d4089906ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: security-audit/validate-coverage-ledger.cjs: FileTooLong \u2014 651 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 151 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":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f33f41a21bb2650b8113cbc02551dda95d6901d1e6a00296bd45edc9a82c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/protocol.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 150 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":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"578677ca98a5ddbe4704036eac4036c9ccb199b597ab1b0caa8f4ad64529092f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::views::build_sign_in: FunctionTooLong \u2014 mila_native_linux::views::build_sign_in 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":"mila/native/linux/src/views.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab20e8851a71ce509d2eb765905f1f07938cd98caa63048e1ef517e170f66976"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overalls_protocol/ssh_command.ex: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 35 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":"protocol/lib/overalls_protocol/ssh_command.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ed2f9e1082f1211a778c99ded4da82bee7cbe9085fc7f39b74b3a76930bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeState: ClassTooLong \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), 24 methods, 2 blocks, lines 47-761. The bar is 400 significant lines; this is 119 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":"mila/native/linux/src/main.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"15345edf7603535352fe98ab1ea6916c49ae4caacec98f340bd0b563723c6bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/checkpoint_storage.ex: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 32 functions. The bar is 500 significant lines; this is 144 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":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f0cfdd17ce75ea2329ee3493797ed00a07440e99c89827ed2390e0215abb20"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ApplicationSession: TooManyMethods \u2014 38 methods, declared across 10 files: src/machines.rs (7), src/devices.rs (6), src/lib.rs (6), src/terminal.rs (6), \u002B6 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":"mila/rust/mila-session/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a45745ed1d50b72c1df44cae1f1c3752e02220bdc15c93078043c7bb706a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overalls_protocol/terminal.ex: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/terminal.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"285ad1372549bc943a65008b591049cbe22c8932aba7a8619d7cf7bbb712afee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/skills.ex: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 functions. The bar is 500 significant lines; this is 120 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":"marshall/lib/marshall/agents/skills.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b9ed91caa4e10ffdc9058811799ca23292805073001cc07474fd17726f411e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vm/executor.ex: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 115 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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"691173933fb97db47315bc76374c562fe54e1ea9f329c85b4a0e14cbe986084f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Worker.launch: MethodTooLong \u2014 launch 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":"nix/domains/artifacts/vscode-web-broker/src/windows/worker.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa01eae6683da8c372f3d4b1af4c48bbac6a3273330e2729cf5fe0f13a9aae2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace_receiver.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":"lyra/src/workspace_receiver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057a1adf4d2f4b5d57809e7793800e7f9984d03682f71de7224d5da727f9abc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: MilaNativeUI/MilaFFIAdapter.swift: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c9cf94c97423072787334db553510de366441b8035044e6c2ecff1157e9bbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: galileo/upstream.ex: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 33 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":"galileo/lib/galileo/upstream.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d507123de24077bce8f9546708081060281d7d7fd2020541c2a06c3d313f803"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows-dotnet-smoke/LifecycleSmoke.cs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789f150146690584b5dc7bdee67b4c0cfe96c377c45207e4a338a28c3923728a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: lyra::update: 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":"lyra/src/update.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac66b45d55a9d47f120068aa326aca391cf84f3a7ab69a11a5183e6754b69fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verification/campaign.py: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"antithesis/verification/campaign.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20912738ca9a1ea080df481c54a55850d7ed96909096e50f851a19f4d2b0692a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet-exporter/runtime.py: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7661b82c8bdda0605f236b5d333a4b084c9c6e81d8a9e5ffb4d3d9dab65c32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: android/session_bridge.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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0697cb8e444418d0be935ac087ee513192d52141bf1ce732235c31be22753a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsView.body: MethodTooLong \u2014 body runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d04a5478685a4ae9af19b0878360c80a9007c07f4eee4c7d2958997c805cdd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Checkpoint: TooManyFunctions \u2014 35 functions. The bar is 30 functions; this is 5 over it, 1.17\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fae32c85aaa6edf7ac8f5fc19319c4201b23060e55929eee8c8aa336613409d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lilly/events.ex: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"lilly/lib/lilly/events.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149b0fe295c29c4d85c01fbda944c6fc71329228f92ae00ac8202f8cc7f32bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 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), about 89% of them inside a single declaration: NativeState (2 blocks, 47-761). The bar is 500 significant lines; this is 80 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":"mila/native/linux/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8a004b575ab5e9ddb43460ea3dfdc3e42aa48e2c576d29f64dc2e2db76dae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_zfs_namespace_unmount::sweep::sweep: FunctionTooLong \u2014 lilly_zfs_namespace_unmount::sweep::sweep 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":"lilly/native/zfs-namespace-unmount/src/sweep.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"892b5c74df60766780cf6b50bcc2f05845f66989702cb6c0a9c84deeff92eef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transfer.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 70 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":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2b0841a0f23c07288a4b2dfd0613c1ebb539ea87cffb4cef22a2b7b23397a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/context.ex: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 31 functions. The bar is 500 significant lines; this is 70 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":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3665b36fcd0c033f142850a2e4f00a6b104e5bcc5102f960e120dd8ef9d187af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mila_native_linux::views::build_deployments: FunctionTooLong \u2014 mila_native_linux::views::build_deployments 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":"mila/native/linux/src/views.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0165129342eefb712a750adeeb66e0892b67d93c0a3b382fcc9df0b7e0e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/install.py: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"nix/domains/artifacts/guest/windows/install.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3ef83d5b8f111339d10388d4a5df023f7a6decefb677aea72f8d79666bbbf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lilly/guest_executor.ex: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 42 functions. The bar is 500 significant lines; this is 67 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":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e7e08911f3948bb4bd2d3df6cc0cfd2c785ecec4d7047066d73cd9cafa4ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Network: TooManyFunctions \u2014 34 functions. The bar is 30 functions; this is 4 over it, 1.13\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f963c7975425fda6a0c653fe6eb7101eb9abdaefaf90964cf87aac66c4ac7335"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_terminald::log::encode: FunctionTooLong \u2014 lilly_terminald::log::encode 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":"nix/domains/artifacts/terminald/src/log.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d203c9324342779358fb503ddbcb27e7cb6fd194f9a8f30fc70e67b8b96b0b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/model_protocol.ex: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall/agents/model_protocol.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a2869a61c696b14b64a8bc4cdb4409519be849173d4a0b6f4dc4f736e17a22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/enrollment.py: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"nix/domains/artifacts/host/enrollment.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"351642eb6a46c82223fc18a6fe18d22b39d430cdc3863620dcc254bcd90eadc1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TerminalScreen: ClassTooLong \u2014 445 significant 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 97-673. The bar is 400 significant lines; this is 45 over it, 1.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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ca04e13cad1b03da5a7c8a5a77a67b1f42d0b94d37a66963a71f5f8c9bf234"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: overalls_vscode_web_broker::windows::account::account_token: FunctionTooLong \u2014 overalls_vscode_web_broker::windows::account::account_token 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":"nix/domains/artifacts/vscode-web-broker/src/windows/account.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c552342c52ae30b78bde963415067aff9109701503bf5858ff91b168778f5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Authority: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/authority.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5230c7a95f838d18c0fc64eb161d7cffcbbe0e78874b99b4b2166ede975dc79a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: security-audit/validate-findings.cjs: FileTooLong \u2014 547 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 47 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":".agents/skills/security-audit/validate-findings.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09859728764d9e1f0981f0446d40c48aec5a5d39c013aa2a735d635f5370ea70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/resize_live.ex: 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":"marshall/lib/marshall_web/live/resize_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c65c25ade99e854c0d4f7a4dae12c4a8ef8b3f4bb725e476347a5e7b1001b64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_hostd::vm_launch::argv: FunctionTooLong \u2014 lilly_hostd::vm_launch::argv 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":"lilly/native/hostd/src/vm_launch.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6cd5c1f4bea83212de284e2f0a83364b7b77cfe6e1a37623ca36e0251b8d8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: recorder/scenarios.py: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb56a153701eb876bfabcc99b3e71abf6c7b699b4b7dd12c1ad980f7e6c3ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/windows_main.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":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95321beadf7f1079c997600b49fd27ff91a1f41180f04df725741d4ff9227d43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApplicationSession.thread_action: MethodTooLong \u2014 thread_action 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":"mila/rust/mila-session/src/threads.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c5f49641e42290fa5ab656881caf355fc8c0475783f2bce7acfbf3bcf65e29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live/integrations_live.ex: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall_web/live/integrations_live.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d4b9ac09d58e9bb32be690b24dd301f8ace2422ddf2e25d040943f41cc9be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/screen.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), about 84% of them inside a single declaration: TerminalScreen (2 blocks, 97-673). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1105db66d46281e1c9deb9f5dbebe7b9d307891f7d71bea608e49a94d5e781d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: otel-guest/browser_journey.py: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"nix/domains/system/otel-guest/browser_journey.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e20cc84fa31a298198619c45ea96e131b7f2bc940f6d2f8d20ee15ed5648a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/executor_session.ex: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9375f186b0c41a7f539c83958537a2306fe974073ca662772621d0069271b6f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Daemon.attach: MethodTooLong \u2014 attach 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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a100f0f250133af005073f5e3f5028c62e8472143130bac76a95109754d56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lilly_terminald::sys::conpty::s4u_token: FunctionTooLong \u2014 lilly_terminald::sys::conpty::s4u_token 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":"nix/domains/artifacts/terminald/src/sys/conpty.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"40503a410b63e5eadae31db6e1dc8deeff4429b39268851b965a4d39591da20a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TerminalScreen.decode_sixel: MethodTooLong \u2014 decode_sixel 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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e67a1668e0f9bfadd85646bb2e63d164cfc8f30cad5deede1710e454b5e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/overalls-ssh-authorize.rs: FileTooLong \u2014 510 significant lines (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 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f9d71dc94fceaa58440db3adad4cfe938f5c8cc26fbb749aba2dad6ceebd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/store.ex: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 36 functions. The bar is 500 significant lines; this is 8 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":"brady/lib/brady/cache/store.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1aa76dbb9bd589e3cb0a7973e0611ce04a7a6fdbabddbcea1e10db06fdd197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/packaged_instrumentation.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd820e10b0cb7ce0b2ca1383e35d90bbe32cfa46bf1aa9a1d8b3ad9dcdd5f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/host_stream.ex: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"marshall/lib/marshall/terminal/host_stream.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff733d5fe5588c6c7e9b6764a77945f6debebeb13748d14ec748a4bafbbebed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): nix/domains/artifacts/terminald/src/sys/conpty.rs:376-525 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:255-410 \u2014 These two members are variants of one another: 43 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":"nix/domains/artifacts/terminald/src/sys/conpty.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84d4d0a845611f033882e116cd63ffe62fb1316ee7c7dafad56e84da1357588"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): marshall/lib/marshall/redaction/coordinator.ex:53-144 | marshall/lib/marshall/redaction/coordinator.ex:148-191 \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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff5457d8f907c41eef241b0864c8bacd015bf91a58816c9bc61ac0a27cbb16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): audi/lib/audi/tls/fleet_material.ex:150-171 | marshall/lib/marshall/ingress/acme/material.ex:150-171 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf99d3dd48e913db96242e5872311e2b8085b6053a9e25ce5274d79b6baee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): marshall/lib/marshall_web/admin_elevation.ex:32-55 | marshall/lib/marshall_web/components/layouts.ex:438-455 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/admin_elevation.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6a591541710326cfa8e939a7134de6737ad05a950ead347bfcf8cc6c2cc551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): nix/domains/system/otel-guest/receiver/src/slo.rs:392-409 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:171-188 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae52acfc4357460dfa2d880e30578a35b7fa8a4de0f23eb6757356289be553b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mila/native/linux/src/route.rs:438-457 | mila/rust/mila-model/src/lib.rs:21-40 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6f232d3eb1464fcf9a5f159f43103ab80f465f80927b3bf5d4504d3d32f9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): lilly/lib/lilly/control/client.ex:136-163 | lilly/lib/lilly/control/client.ex:263-291 | lilly/lib/lilly/control/client.ex:313-341 | lilly/lib/lilly/control/client.ex:363-391 | lilly/lib/lilly/control/client.ex:413-441 | lilly/lib/lilly/control/client.ex:463-491 | lilly/lib/lilly/control/client.ex:511-539 | lilly/lib/lilly/control/client.ex:559-587 | lilly/lib/lilly/control/client.ex:607-643 | lilly/lib/lilly/control/client.ex:667-695 | lilly/lib/lilly/control/client.ex:715-743 | lilly/lib/lilly/control/client.ex:765-793 | lilly/lib/lilly/control/client.ex:815-843 \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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"69203d926267bb34d7d850e76e4916716750ff14c26041179ec72666356dc3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): protocol/lib/overalls_protocol/relocation_cleanup.ex:102-116 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:84-98 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:96-110 | protocol/lib/overalls_protocol/relocation_import.ex:38-52 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:95-109 | protocol/lib/overalls_protocol/relocation_keys.ex:104-118 | protocol/lib/overalls_protocol/relocation_readiness.ex:107-121 | protocol/lib/overalls_protocol/relocation_receive.ex:96-110 | protocol/lib/overalls_protocol/relocation_revocation.ex:95-109 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:98-112 | protocol/lib/overalls_protocol/relocation_source.ex:115-129 | protocol/lib/overalls_protocol/terminal.ex:690-704 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"931e4c8835c04bb8f0bd3435743a02540df2a8ed8a1f13b8c60acdb385cc8de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): marshall/lib/marshall/compute/relocation_cleanup.ex:135-156 | marshall/lib/marshall/compute/relocation_destination_cleanups.ex:23-49 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:16-43 | marshall/lib/marshall/compute/relocation_imports.ex:27-53 | marshall/lib/marshall/compute/relocation_key_retirement.ex:15-41 | marshall/lib/marshall/compute/relocation_keys.ex:18-60 | marshall/lib/marshall/compute/relocation_probes.ex:28-56 | marshall/lib/marshall/compute/relocation_readiness.ex:27-52 | marshall/lib/marshall/compute/relocation_revocations.ex:16-43 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:16-44 \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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4808118c46e02dc1723d58d6913a30f3d01a58e8dc54ee5bc6290dc6ec83391c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): mila/rust/mila-ffi/src/session.rs:336-356 | mila/rust/mila-ffi/src/session.rs:373-402 | mila/rust/mila-ffi/src/session.rs:419-449 | mila/rust/mila-ffi/src/session.rs:465-487 | mila/rust/mila-ffi/src/session.rs:503-524 | mila/rust/mila-ffi/src/session.rs:543-581 | mila/rust/mila-ffi/src/session.rs:729-750 | mila/rust/mila-ffi/src/session.rs:867-891 | mila/rust/mila-ffi/src/session.rs:1124-1145 | mila/rust/mila-ffi/src/session.rs:1197-1221 \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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e217ae168c365f481cafe719e92c4103a4ab31659d86a5bbe78db73e2f386de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): mila/rust/mila-ffi/src/android/session_bridge.rs:159-185 | mila/rust/mila-ffi/src/android/session_bridge.rs:197-220 | mila/rust/mila-ffi/src/android/session_bridge.rs:237-263 | mila/rust/mila-ffi/src/android/session_bridge.rs:279-316 | mila/rust/mila-ffi/src/android/session_bridge.rs:474-503 | mila/rust/mila-ffi/src/android/session_bridge.rs:696-715 | mila/rust/mila-ffi/src/android/session_bridge.rs:748-768 \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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"605c74d7e264aca294ffd9b7ad5db691e5d907aa23707689a260e096c1874d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lilly/lib/lilly/vm/credentials.ex:107-131 | lilly/lib/lilly/vm/flush.ex:11-42 | lilly/lib/lilly/vm/guest_trust.ex:67-92 | lilly/lib/lilly/vm/inception_exchange.ex:77-106 | lilly/lib/lilly/vm/kernel_attestation.ex:78-108 | lilly/lib/lilly/vm/readiness.ex:68-91 \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":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a7ff069a4061fd15d34e6a51dfceb350fcd3eaef6efef066008ce135aee511"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lilly/native/boot-log/src/main.rs:6-14 | lilly/native/ingress-bridge/src/main.rs:6-14 | lilly/native/launch-guard/src/main.rs:6-14 | lilly/native/resume-token/src/main.rs:6-14 | lilly/native/source-export/src/main.rs:6-14 | lilly/native/transfer-stream/src/main.rs:6-14 \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":"lilly/native/boot-log/src/main.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e4984ff6e89205ca057300f8945ab4a5bbccd3122ad11934add7a7034219c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): audi/lib/audi/otp_reports.ex:18-35 | lilly/lib/lilly/otp_reports.ex:18-35 | marshall/lib/marshall/otp_reports.ex:18-35 | porsche/lib/porsche/otp_reports.ex:18-35 \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":"audi/lib/audi/otp_reports.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd90e922f07619c272d2a97d51e2968d8d1f7aeb6221ae68d3e37331904ff275"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): audi/lib/audi/relay/server.ex:66-86 | lilly/lib/lilly/ingress/server.ex:114-134 | lilly/lib/lilly/network/attribution_server.ex:97-117 | lilly/lib/lilly/private/server.ex:97-117 \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":"audi/lib/audi/relay/server.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"628fa333f0fc94f97eaec3c2588bef19abf823694748ac105f1ffd8c251a7a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): audi/lib/audi/relay/server.ex:107-128 | lilly/lib/lilly/ingress/server.ex:323-344 | lilly/lib/lilly/network/attribution_server.ex:151-172 | lilly/lib/lilly/private/server.ex:151-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":"audi/lib/audi/relay/server.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"10322b1a10199689689e15aeb75ac1da0dd2d2d0b53ab2f3cc3d761d1c47ca95"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lilly/lib/lilly/transfer/clone_copy_journal.ex:167-184 | lilly/lib/lilly/transfer/import_journal.ex:112-129 | lilly/lib/lilly/transfer/import_journal.ex:168-198 | lilly/lib/lilly/transfer/snapshot_journal.ex:166-183 \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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a58cff608330870d3208f2cc36988b94840f83b692779ad96ec97e625fc21a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): marshall/lib/marshall/agents/cli_access.ex:138-168 | marshall/lib/marshall/inference/retention.ex:11-66 | marshall/lib/marshall/ingress/environment_stream_retention.ex:15-36 | marshall/lib/marshall/ingress/retention.ex:15-36 \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":"marshall/lib/marshall/agents/cli_access.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1f27de1b6b5fba54d079193ef1af8f7d1b1c464402e9888363029bac78973d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): marshall/lib/marshall_web/live/admin/access_live.ex:24-32 | marshall/lib/marshall_web/live/admin/access_live.ex:36-44 | marshall/lib/marshall_web/live/admin/access_live.ex:48-56 | marshall/lib/marshall_web/live/admin/workloads_live.ex:45-61 \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":"marshall/lib/marshall_web/live/admin/access_live.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd40c56aa99a9da65ca064a88ba3751cfb380b33d8a2568d33537346d41b7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35-48 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:34-47 | protocol/lib/overalls_protocol/relocation_revocation.ex:34-47 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:37-50 \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":"protocol/lib/overalls_protocol/relocation_destination_revocation.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"92386d52196437977f1bae1127fbde95b2e0e3ce8125a91f0d592d6383d3efe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): antithesis/workload/control/delivery.py:131-150 | antithesis/workload/control/dispatch.py:35-54 | antithesis/workload/control/host_sessions.py:50-70 | antithesis/workload/control/scenarios.py:38-57 \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":"antithesis/workload/control/delivery.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a437c9ab4ff7176c445f62c33542cc03e034ba835473ebdf3ecbfa7d5eedf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lyra/src/guest/mmds.rs:52-61 | lyra/src/guest/readiness.rs:44-53 | lyra/src/native_guest.rs:324-333 | lyra/src/platform/windows/boot_id.rs:20-29 \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":"lyra/src/guest/mmds.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd15ed45d2f388315aad4a0e06de948847d3846efaa0f21ca286582694f5a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): mila/native/linux/src/pages.rs:347-1019 | mila/native/linux/src/pages.rs:1026-1299 | mila/native/linux/src/views.rs:126-274 | mila/native/linux/src/views.rs:1108-1268 \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":"mila/native/linux/src/pages.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"701b2c390746f44454e7efdb25f4b053a1662676cabd339db51743a66583f127"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): mila/rust/mila-ffi/src/session.rs:276-332 | mila/rust/mila-ffi/src/session.rs:1411-1473 | mila/rust/mila-ffi/src/session.rs:1641-1683 | mila/rust/mila-ffi/src/session/watch.rs:44-60 \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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1977f48d15e1c451708fb1ec34aac2821b7e3947e409075e4c1ad9b2245bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): nix/domains/artifacts/guest/native-promotion/test_verify.exs:392-434 | nix/domains/artifacts/guest/native-promotion/verify.ex:185-233 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"nix/domains/artifacts/guest/native-promotion/test_verify.exs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb06e23e7336a204995d80d95a1b6cc6c1a9a83f7f4a7ec692e43039b8fde180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): lilly/lib/lilly/ingress/server.ex:18-84 | lilly/lib/lilly/network/attribution_server.ex:12-67 | lilly/lib/lilly/private/server.ex:11-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacd76fbe4669e4d52bafdb990c54ad7cf4b63a16fecdc9f99b513921d4adb43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): antithesis/workload/control/rotation.py:28-96 | antithesis/workload/repository/restart.py:27-90 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"antithesis/workload/control/rotation.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a78b9194b2299512585ab3e128be55397226d9d1ffd1c0dc487652919dd0de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): audi/lib/audi/http/browser.ex:48-87 | audi/lib/audi/http/editor_browser.ex:48-87 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c886bdaf6f62dcc1930a2b53fe98a9ed80b4b302aaa570fb710f4bbda9a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): nix/domains/system/fleet-exporter/runtime.py:295-355 | nix/domains/system/fleet-exporter/runtime.py:359-415 \u2014 These two members are one piece of code written twice and then edited apart: 57 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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f4c0c8dfef74a2bb981d2d1fc49e88966b34a64476a8f6d5e2e79ed9ced2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lyra/src/bin/overalls-trustd.rs:128-163 | lyra/src/guest/trust.rs:67-103 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"520672b17958d0137783efbec12a64082afe91f715c0c15289eb9cef44c012ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 57\u002B corresponding lines): audi/scripts/invalid_boot_probe.exs:17-73 | enrico/scripts/invalid_boot_probe.exs:11-73 | galileo/scripts/invalid_boot_probe.exs:11-74 | porsche/scripts/invalid_boot_probe.exs:25-90 | ziggy/scripts/invalid_boot_probe.exs:11-75 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 57 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/scripts/invalid_boot_probe.exs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bb5a8f969648eb64387889f3c5f30b3f7cd7a9d19f867b7706d47f425176b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): lilly/lib/lilly/vm/executor.ex:424-490 | lilly/lib/lilly/vm/executor.ex:494-555 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"945de82fac06364142bd658d2a0f2d40896ebe5349e1a7efb62f43c8d8d3f050"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): antithesis/workload/admission/client.py:241-290 | antithesis/workload/admission/client.py:294-351 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"antithesis/workload/admission/client.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a156bee1742a4ccb4b0d3d55a6b427ec01cb825cba6ad3f7ca8066447dc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:320-351 | mila/windows-dotnet/Interop/RustNative.cs:415-448 \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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"110812ddeb9b098f63c952d0fa2e11172462d5b0f89f6c785d6c839bc8667fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): marshall/lib/marshall/ingress/services.ex:34-77 | marshall/lib/marshall/ingress/services.ex:81-139 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/services.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0fe4f9f25f66c9c97813c03ea31b0572e7b9606c8a39df2db773a83b2d786d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): mila/rust/mila-ffi/src/session.rs:605-665 | mila/rust/mila-ffi/src/session.rs:942-993 | mila/rust/mila-ffi/src/session.rs:1018-1073 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a48a0f41508d6fd1b1dc3868227edf591ec2f3c0c6336c08391bec6feedd165"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lilly/lib/lilly/transfer/received_dataset.ex:255-284 | lilly/lib/lilly/transfer/received_dataset.ex:302-322 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee20c8811353170b15215d908263fcbd79d66c6d4f2f61430b3140ff7002ea2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): marshall/lib/marshall/galileo/authorizations.ex:191-227 | marshall/lib/marshall/inference/requests.ex:195-231 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"85231c65f1321206779b0e655a40c3a6c4d964de2f1147caf2626175007e70a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lyra/src/bin/overalls-trustd.rs:81-123 | lyra/src/workspace_receiver.rs:61-94 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee61d6a53b44f3463dcb376f06d2a4a95f6496370e12e3248a69393c6785ba9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): marshall/lib/marshall/access/sharing.ex:120-148 | marshall/lib/marshall/threads/sharing.ex:119-143 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46591db31749f9922680d4bbf4296f740a96b654c5a4c6378531fc4c94e65c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): marshall/lib/marshall/access/sharing.ex:52-93 | marshall/lib/marshall/threads/sharing.ex:49-90 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb0f71712ff3f0541d2fd73b87140b54934fbddd486309683f649a7f0b00bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): lilly/lib/lilly/transfer/permit_journal.ex:34-73 | lilly/lib/lilly/transfer/permit_journal.ex:108-158 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef8a1d80016ae343caa544fb06a3559b5cd90547c17297a6c213c65aa1181e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): mila/windows-dotnet/MainWindow.xaml.cs:422-451 | mila/windows-dotnet/MainWindow.xaml.cs:481-507 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e6b6219fb673b95885799ada9510f92cad6d34db1d676d699a3458de7b0ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): antithesis/workload/repository/operator.py:17-63 | antithesis/workload/satellite/operator.py:36-82 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"antithesis/workload/repository/operator.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4fd5afb9163fb301b89cde75f1242be48513bf59632111b0145fa41b5c5366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lyra/src/bin/overalls-host-certificate-windows.rs:63-104 | lyra/src/bin/overalls-host-certificate.rs:58-90 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce138a2d66726deb48ffa48da12b964ba08f5d974f01eccc53995d307dda6321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): galileo/lib/galileo/config.ex:5-39 | peach/lib/peach/config.ex:14-38 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/config.ex"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d528ecd4155cc7b584fefee5ef7daafea59b0ee6b6d3e79606df57828aacba0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): marshall/lib/marshall/compute/relocation_coordinator.ex:314-339 | marshall/lib/marshall/compute/relocation_readiness_state.ex:103-130 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"87766b066248ad29cb142ddb8755854a36c3b73d6f53ac7608a6a8a8f43539e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): marshall/lib/marshall/access/admin_actions.ex:35-70 | marshall/lib/marshall/ssh/admin_actions.ex:98-137 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"marshall/lib/marshall/access/admin_actions.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5051c31b82624da675acc3956e7a22d734a27441f6f60f06fce7815c6c5d02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lilly/lib/lilly/network/ingress.ex:21-66 | lilly/lib/lilly/network/ingress.ex:86-129 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network/ingress.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e3ee86ebbf512186cb688537d097dd7865c25e818f30df43b414e0ed716c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): mila/native/linux/src/route.rs:19-47 | mila/rust/mila-model/src/route.rs:141-168 \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":"mila/native/linux/src/route.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c7b94f8a6432a62032d6d0fe0733dfdd37e4ae45098aff54e2ea99e78c69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): mila/rust/mila-ffi/src/android/session_bridge.rs:332-368 | mila/rust/mila-ffi/src/android/session_bridge.rs:385-424 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a15a7ea1777cce9c58b7b5a0f2f1b6fc0abded6f1f2fdfbc44c0f1d0c2eeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:795-815 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:81-104 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:412-431 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eb0182a82dc93840e2210db826f25b653b2c530c636811958ce6aab03ae42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): nix/domains/artifacts/guest/inception/control_tls.py:151-182 | nix/domains/artifacts/guest/inception/observations.py:208-232 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/control_tls.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3620c0043aebe678d144ff9990e75ceacdb4c259e4c8aef15e7b655002f4d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:67-97 | lilly/lib/lilly/host/ownership.ex:100-129 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f28a675f8aaa931988de401536f7888660aa3e25ffd9be6828eb4621dfc1e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): audi/lib/audi/http/browser.ex:18-43 | audi/lib/audi/http/editor_browser.ex:18-43 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee5c298e4fef7038a7395ef188422514aee2329c00f54eaf4f27da3a7c25760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): marshall/lib/marshall_web/android_display_socket.ex:15-47 | marshall/lib/marshall_web/terminal_socket.ex:16-43 \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":"marshall/lib/marshall_web/android_display_socket.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e894f015eae1388aef70e815b3d2e2ca757dcfec5c01659b9c23824ef09671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): marshall/lib/marshall_web/controllers/audi_login_controller.ex:12-45 | marshall/lib/marshall_web/controllers/editor_controller.ex:40-69 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/controllers/audi_login_controller.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5305022b4cc8733a96511eb62f9c98e23be51b91105b10ec0a7cdd90bffd68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:18-45 | lilly/lib/lilly/host/ownership.ex:20-48 \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":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eef0117fd6b120380acee68471d23d23b8686009961b9b2cedf385fbcff2aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): marshall/lib/marshall_web/ingress_api.ex:51-76 | marshall/lib/marshall_web/ssh_api.ex:41-58 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/ingress_api.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43137d7e3cc3be5674da2543611e58a47f4016bbc3e4df3688deaf45dba780d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): marshall/lib/marshall/compute/service_levels.ex:68-89 | marshall/lib/marshall/compute/workflow_service_levels.ex:143-176 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f4bd21618128bf7e7a84f14a14dd6c897cb8bf4752c0cd40e1fe241eaf45e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): antithesis/workload/repository/fixture.py:40-65 | antithesis/workload/satellite/origin.py:60-85 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/repository/fixture.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5917347db26b31b245d6091e1415193c41faa5387e19f7dfcea9c9f1ef45a010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): marshall/lib/marshall/compute/relocation_cancellation.ex:13-60 | marshall/lib/marshall/compute/relocation_retry_admission.ex:20-58 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_cancellation.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"79024b6d4c22cbee17567ee9c283050616bc03cf4eb17ef0d980b9dddacdc928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): nix/domains/artifacts/guest/readiness.py:101-135 | nix/domains/artifacts/guest/readiness.py:139-172 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/readiness.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7287c6dff60e25317dd2f58b77f078005f14d23224f6ec793d5f31c0228e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): audi/lib/audi/control/client.ex:44-73 | porsche/lib/porsche/client.ex:129-151 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"591796759c177b5261a63f80f9a48a9133c1fae2428c46bfe79150b6d1c628a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lilly/lib/lilly/host/zfs.ex:567-585 | lilly/lib/lilly/host/zfs.ex:627-646 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"441269b620ec3b823261e69228eac1c457216d10e2c1dcfbe0b69b3eb8f11876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lyra/src/bin/overalls-workspaced-windows.rs:96-136 | lyra/src/bin/overalls-workspaced.rs:68-99 \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":"lyra/src/bin/overalls-workspaced-windows.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c85c7146dd4af350a9321c9721fe2aab21b4e446fb7b9719e777a0fd1d1032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): audi/lib/audi/inception/client_hello.ex:18-47 | brady/lib/brady/tls/hello.ex:12-39 \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":"audi/lib/audi/inception/client_hello.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c157554b14ad0a3a1f71c5559b6163de8e85f38f91b4b98ecd5d3788267cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lilly/lib/lilly/transfer/key_runtime.ex:110-133 | lilly/lib/lilly/transfer/source_runtime.ex:132-156 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04b7a18293e8ed1d19aa81d954bb17f0a1c44d1ac6d0dd9ca4a8f3d58b8c65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): antithesis/emulation/host/runner.py:94-112 | antithesis/emulation/recorder/runner.py:67-89 | antithesis/emulation/storage/runner.py:82-100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c64d557f9e42931a78e222bbc03c4bd1c8865d260b433e064cbea54fadc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): marshall/lib/marshall/ssh/guest_access.ex:21-50 | marshall/lib/marshall/ssh/guest_access.ex:62-100 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/guest_access.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1060d3accf137d2dfcbac7812e51c1899dbd47205f5022a60d4661f211016be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): marshall/lib/marshall/teams/coordinator.ex:249-278 | marshall/lib/marshall/teams/coordinator.ex:286-319 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/teams/coordinator.ex"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b859b655893b4a7553169038848767b82a8e72f7c7fc68652944c0cae7c39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): nix/domains/system/brady/storage.py:81-108 | nix/domains/system/fleet-exporter/runtime.py:147-176 \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":"nix/domains/system/brady/storage.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"796d96cd51a27474912121a7fcee08f1367c627e3a5697ea627a1828497dda01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lyra/src/bin/overalls-ssh-authorize.rs:142-161 | lyra/src/bin/overalls-ssh-authorize.rs:163-180 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad0d8cd92d0605fce4395b05ab7db90494ef9f1fdf40bccc4dd537044f9df8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:302-327 | nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:331-362 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec66c952ae576ed7d26debaf6e62f4bb51fb2b217bb7c475fb1ef1f18688e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): marshall/lib/marshall/ingress/web_streams.ex:43-91 | marshall/lib/marshall/ingress/web_streams.ex:123-146 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/web_streams.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e6529776ff561e0b9d87a98e13ba0d2ae7c42a4e1cc8ee156d76da7176b6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): protocol/lib/overalls_protocol/editor_stream.ex:46-62 | protocol/lib/overalls_protocol/web_stream.ex:52-67 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"41df8425c4fd34906edafc92ca048d841ac4b74c06c25d45ec9f7a6047a14525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lilly/native/boot-log/src/cli.rs:23-52 | lilly/native/launch-guard/src/lib.rs:86-119 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/boot-log/src/cli.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"29458609e84ee2bdf90b7bb6bbecff7d988a763ca45b7ac625480be29959a190"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:496-503 | mila/windows-dotnet/Interop/RustNative.cs:507-527 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa86a2fb3f3cf939935659747c7571172b68af97662967eaa70f4f90682a3d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): antithesis/workload/access/mail.py:73-101 | antithesis/workload/access/mail.py:104-126 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/mail.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f306b9aeef44aa3d55fd2f93c4f1a27fc34eabffa5b8db9d905372b27f730d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:257-273 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:275-292 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b1a011343b7355824fe8155a79bf22ceacda10b1bf712a278143325d9a844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): mila/rust/mila-ffi/src/android/terminal.rs:239-264 | mila/rust/mila-ffi/src/android/terminal.rs:275-306 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"267bcdf2118b3dddf9b7979e2ff20a7fa2ef0df7afb0ffc2d1e6c19d85d883c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lyra/src/bin/overalls-readinessd.rs:94-121 | lyra/src/native_guest.rs:23-50 \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":"lyra/src/bin/overalls-readinessd.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b65298d66c1e56849583e64599d387a89be31cc205f63fbd7c3e85b836848f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:618-638 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt:859-877 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdc4e19d40d83eabc8f4826efc3bb6e8b4bc6f29ef5174999db85b6f940895b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): marshall/lib/marshall/github.ex:631-669 | marshall/lib/marshall/github.ex:675-705 \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":"marshall/lib/marshall/github.ex"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe508394df6a841b0f532fac32f5112ec354fb017d23a42d98c15770a10b444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ziggy/lib/ziggy/http.ex:200-216 | ziggy/lib/ziggy/http.ex:229-245 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/http.ex"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebc999f5576a3ea867ace5816a0a14f2c518c5ea81fe96fa54112b43912830b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:155-174 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:177-193 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"74088bf323928d3f1f6866b344e3cfe60b905a4b62eeadd903fda786b082018f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lyra/src/ssh_config.rs:22-41 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:24-43 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/ssh_config.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d185c99f07951e12bd364e580cc981d52762fe25d944b71c7914568c391732b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): antithesis/emulation/host/runner.py:116-153 | antithesis/emulation/storage/runner.py:111-154 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf3fee6754314e656cfcd5970b1f274b85a263e2a08c8196b5d63c77c728fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 38\u002B corresponding lines): protocol/lib/overalls_protocol/image_manifest.ex:224-261 | protocol/lib/overalls_protocol/image_manifest.ex:286-325 | protocol/lib/overalls_protocol/image_manifest.ex:498-537 | protocol/lib/overalls_protocol/image_manifest.ex:557-596 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dde551af87682b65409df981428bf8b5264b2210cd6586cbe6e300e05861fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lilly/lib/lilly/transfer/key_runtime.ex:63-89 | lilly/lib/lilly/transfer/source_runtime.ex:78-113 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec7c2039907d474c0221868d78c0bbdebce842ba8f22e52c7c54f2850f3be2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): mila/rust/mila-ffi/src/session.rs:152-183 | mila/rust/mila-ffi/src/session/watch.rs:62-86 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"be983690bd62f110cb071a444108ede5714c238f9eb822f08c907d76c75b359f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 33\u002B corresponding lines): marshall/lib/marshall/compute/credentials.ex:30-69 | marshall/lib/marshall/galileo/credentials.ex:14-46 | marshall/lib/marshall/inference/credentials.ex:15-47 | marshall/lib/marshall/peach/credentials.ex:14-46 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/credentials.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0949b1e80a8aa92f702ffe6a4fe61a20127490dadde07aa4ed3d515803f52aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lilly/lib/lilly/host/zfs.ex:480-495 | lilly/lib/lilly/host/zfs.ex:508-523 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6e672ece2b9ac1572620fb64de09d783e192df91712b693df3ca59bc9df7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:453-471 | mila/windows-dotnet/Interop/RustNative.cs:482-493 | mila/windows-dotnet/Interop/RustNative.cs:684-700 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbee0ef584c8076b5da0da8b1f518bfe0c3ac0e82d3b5d8d97c84435259a2d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lyra/src/bin/overalls-host-certificate-windows.rs:106-124 | lyra/src/bin/overalls-host-certificate.rs:91-113 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe097002f93c80f6f86813ae50dcd6b1b1a0d434aec4751c4741c44848859be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lilly/lib/lilly/vm/driver.ex:1911-1929 | lilly/lib/lilly/vm/driver.ex:2063-2089 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0bb01df42150785476074b5c41ca8ab882cca7cd04b44c58dec122fd715167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): mila/native/linux/src/session/commands.rs:127-153 | mila/native/linux/src/session/commands.rs:163-189 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2cb1be638a33c835d100c9b69d846b2fdfa58fc68443a303cc76e79678e2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): marshall/lib/marshall/compute/relocation_cleanup.ex:113-125 | marshall/lib/marshall/compute/relocation_restoration.ex:225-240 \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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91f99535d0d04425089b03d65e4104367d9313bdddbb5d6417bb147fc2774a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): mila/rust/mila-ffi/src/android/terminal.rs:91-121 | mila/rust/mila-ffi/src/android/terminal.rs:165-197 \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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a1daf8eb6077452aaf16ac3467dc345ed8ce9c167d8d9073be9d40298181d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:237-259 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:144-167 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c22ed154a0040072423b43c21285b3298139b87102728ddcc385f4eb5341bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): marshall/lib/marshall/compute/relocation_cleanup.ex:160-178 | marshall/lib/marshall/compute/relocation_imports.ex:57-81 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51b9aa5872c2ff593ffba4c29376dd0c8dc26ce487520b71b017de80ea2f425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): mila/native/linux/src/session/commands.rs:59-88 | mila/native/linux/src/session/commands.rs:429-459 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1039ea94d988aaff9ab45f219f2f15fdd2bd6a5997dfb21497dddd58583b0e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): marshall/lib/marshall/galileo/configurations.ex:12-46 | marshall/lib/marshall/teams/coordinator.ex:31-59 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/configurations.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4df0badd4c95a253e79cd199ba80427b69a883d7c1e0bcbf22de763e51a80ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): marshall/lib/marshall/threads.ex:107-121 | marshall/lib/marshall/threads.ex:142-156 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f286a229aafa7f8f4dfb6ac2d9e44449ba1bb5079e6c0508083dd27d65c41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ziggy/lib/ziggy/http.ex:116-130 | ziggy/lib/ziggy/http.ex:160-176 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/http.ex"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f08586d97332e55f3985b275d321d6f2ca1618b5378fdc7e132636a30e18f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:242-251 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:451-462 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16a7ea787284d2ad89f247e94628f093845323bb09a08944cfd2f17ddee9c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53-74 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:47-68 | marshall/lib/marshall/compute/relocation_revocations.ex:47-66 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:48-70 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4329ae5039469cc86cd20dcb4db5ef6578af30db925d1c70500c6b4e5f3c7367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ziggy/lib/ziggy/bootstrap_release.ex:36-47 | ziggy/lib/ziggy/tool_release.ex:35-49 \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":"ziggy/lib/ziggy/bootstrap_release.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63ffaf8d1ab2fdcaacc6f5ad0a0f5c7352978d1d2e5e91a6762e01773d4b38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): mila/windows-dotnet/Interop/RustNativeLifecycle.cs:207-232 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:348-365 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc456c45e2840cb4785f76b3209ccc6de22cb93a76f1e2d5f741fa9c70c2b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): marshall/lib/marshall/operations/executor_bootstrap.ex:61-79 | marshall/lib/marshall/operations/git_hub_tools.ex:61-80 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"287490c22f554899bbaa71588d327036c4511fa06917e53a617f783b4f3fcaa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): porsche/scripts/host_certificate_boot_probe.exs:150-177 | porsche/scripts/invalid_boot_probe.exs:109-132 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/scripts/host_certificate_boot_probe.exs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c873327cd2728ed8866dbcac3f18153ebb055f84dd3d13ea7444f73022e79fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:602-610 | mila/windows-dotnet/Interop/RustNative.cs:622-630 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cacf00c87d91086064914c4d2b279a95c525f0d555b11e095edf8f816e6773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lilly/lib/lilly/observability.ex:113-129 | porsche/lib/porsche/observability.ex:249-267 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/observability.ex"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"30190b5cd1493a7ed9540ae24530caa323d82608bb1c10ec16b26fadb8133212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lyra/src/bin/overalls-winprobe.rs:51-69 | lyra/src/platform/windows/log.rs:53-72 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-winprobe.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34965c614166607dd7efb6a6456d3cc11972e06672a709cd85f0fb28a891eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lilly/lib/lilly/transfer/clone_copy_journal.ex:192-210 | lilly/lib/lilly/transfer/import_journal.ex:202-213 | lilly/lib/lilly/transfer/snapshot_journal.ex:215-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17fd0bdb3c0d1505a1d05402c1adfd89e598f25af933a233ff1dc0dc74d5ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/transfer/permit_journal.ex:83-93 | lilly/lib/lilly/transfer/permit_journal.ex:180-190 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"94106f4d597665abd19c267e9089c7c96b55b246aced5f9dec84ad8466a78990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): marshall/lib/marshall/ingress/acme/issuer.ex:16-27 | marshall/lib/marshall/ingress/acme/issuer.ex:38-49 \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":"marshall/lib/marshall/ingress/acme/issuer.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f551564d82df40852895bdfb7b40b14f0be8427ec1fbc48811a6fa033f456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): mila/rust/mila-ffi/src/actions.rs:27-50 | mila/rust/mila-ffi/src/validate/snapshot.rs:31-60 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/actions.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"40de3b4355333e63abffe7801e2abd746eea44970ee73f82779467f64893ac5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): antithesis/emulation/host/bootstrap.py:50-67 | antithesis/emulation/host/private_bootstrap.py:55-71 | antithesis/emulation/host/runner.py:67-83 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ff7801ff0822b9740d80f8cfabf4c7f9386105539506436a73ee5ef04d5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): nix/domains/artifacts/secrets/cli.py:292-317 | nix/domains/system/backups/restore.py:20-45 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/secrets/cli.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6f8ff98ed7d1d57f05db39dd6792950f61b667851ebb781bbab50abaeb146"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lilly/lib/lilly/host/pool_snapshot.ex:80-102 | lilly/lib/lilly/host/pool_snapshot.ex:138-155 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/pool_snapshot.ex"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d804884a08d498092eba3d1c727b193e53fd628c9d439df6832fba676ba2b522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lilly/lib/lilly/vm/executor.ex:135-147 | lilly/lib/lilly/vm/executor.ex:165-184 \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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbe5565816d344c7c3760381f141d03a9e0d3dde23cfca7185618ee929ba896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): marshall/lib/marshall/ssh/host_certificate_retention.ex:16-41 | marshall/lib/marshall/ssh/retention.ex:16-42 | marshall/lib/marshall/terminal/ticket_retention.ex:20-41 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/host_certificate_retention.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ca79d303e11575ca14a4ef1889856f87cee6ef8c7cf4d9f7b1f848a6534a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:356-379 | mila/windows-dotnet/Interop/RustNative.cs:388-406 | mila/windows-dotnet/Interop/RustNative.cs:760-773 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07becb6cb4ffb35c0537808d2203dddf5d60fdfc9e297806e1068cf989097b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_health.ex:18-34 | antithesis/lilly/lib/overalls_antithesis/lilly/stub_storage_health.ex:21-37 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_health.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ea4b6ff9b1f80a95fb3affc64aabadcb8c833b5682b2b16bf141724a43f95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lyra/src/sys/windows/iphlp.rs:28-46 | lyra/src/sys/windows/iphlp.rs:49-67 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/iphlp.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bfdce4609c3707973afdb097e5d34b774af6254d55f4d01e09a5632d395221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/native/linux/src/route.rs:218-237 | mila/rust/mila-model/src/route.rs:196-212 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"064d4c0f6bd52ce70dc05f66748d74284fd5d95ab224fe9ebc0007cbe3b14464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lilly/lib/lilly/ingress/server.ex:296-316 | lilly/lib/lilly/network/attribution_server.ex:130-144 | lilly/lib/lilly/private/server.ex:130-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced15b14f9aa2c639cc2b0a56ceb22fb977ca11164c973346768ac25b031cb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): porsche/lib/porsche/ssh/onboarding.ex:28-43 | protocol/lib/overalls_protocol/ssh_onboarding.ex:27-42 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f4da5eeacd7f4d553f4dbd58074aee447a9a509dd28f4f2292d1d52693a198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): audi/lib/audi/control/client.ex:389-411 | audi/lib/audi/control/client.ex:500-521 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ff887715768156c399b9ec86196ccb0b156d243b759ca36a5d5ef46faabbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): mila/rust/mila-ffi/src/session.rs:676-690 | mila/rust/mila-ffi/src/session.rs:703-717 | mila/rust/mila-ffi/src/session.rs:903-917 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe3d63b017faf38099f0d4e22ae2567fffe2397eae46a3fd690b7d49021a814"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/transfer/probe.ex:104-115 | lilly/lib/lilly/transfer/source.ex:108-118 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/probe.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde1b4c7667777a771a3eab7e066b896f7ce57688c9b473a7dc0f6e41a4c3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:405-421 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:423-434 \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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2416ba24be9cdf14df675cf389c43450dfcef2f3b1851fc6b4995e68fa389ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mila/windows-dotnet/Interop/MachineMutation.cs:24-33 | mila/windows-dotnet/Interop/MachineMutation.cs:36-50 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/MachineMutation.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6208e440eadcb0d3d03a39a6df8bc8074e68731e1619d5a6d85c8df846ad02dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): mila/native/linux/src/device_key.rs:49-76 | mila/rust/mila-journey/src/main.rs:200-219 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/device_key.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9774b88925d096b84326489fefccdf051fb59feb8e93ad411e131b42a8ec5bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): marshall/lib/marshall/editor/retention.ex:11-25 | marshall/lib/marshall/ingress/web_retention.ex:16-31 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/retention.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31b38d7c28c8b5df7cf72a5a4c399c02e8773f1fb3f7c03d51aa7f60cb8e407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): nix/domains/system/observability-runtimes/src/fleet_exporter.rs:4-27 | nix/domains/system/observability-runtimes/src/logging_health.rs:16-37 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/observability-runtimes/src/fleet_exporter.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72c724dc4347bf1ee79c29a3519fc11bd64c7f2b5c3766a0ca3522102b83bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): audi/lib/audi/http/authority.ex:14-33 | audi/lib/audi/inception/authority.ex:14-38 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/authority.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4ce24fd610ef818473d8416a313b2ae89f7b8705ffcf58d4c9623b5d60206a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): enrico/scripts/invalid_boot_probe.exs:86-109 | galileo/scripts/invalid_boot_probe.exs:87-110 | ziggy/scripts/invalid_boot_probe.exs:88-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"enrico/scripts/invalid_boot_probe.exs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a97c106bfd0af0498dd97edc47620b069b91458bc37881230f6e8f4c78868b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lyra/src/bin/overalls-ssh-authorize.rs:102-118 | lyra/src/guest/ssh_roster.rs:167-183 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d65a42ad951f387e7927c388f62837728a8359afa34a17adaa137371a622e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): mila/native/linux/src/adapter.rs:389-406 | mila/native/linux/src/adapter.rs:409-430 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/adapter.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a1aff8966fdee0696ba46a61edb6a59f4bb1bef1c045eadbb356e8d5548289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): protocol/lib/overalls_protocol/editor_login.ex:41-50 | protocol/lib/overalls_protocol/web_login.ex:37-49 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_login.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb20ac90e4bb96bdb1e3537c53c46b1cf56a0023f37aca7fe7e4a7743295dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:473-488 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:673-689 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1747f056d7c5bff944a1b34e1afa7b95f19561a77243b70151b0ba35de722939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): lilly/scripts/smoke_guest.exs:153-174 | lilly/scripts/smoke_jailed.exs:469-488 | marshall/scripts/smoke_execution.exs:613-629 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/scripts/smoke_guest.exs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe055b2dae67d36a2e570085608fcd35047e7c5774f8e394eda41148ecd1e40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mila/native/linux/src/device_key.rs:90-101 | mila/native/linux/src/session/signer.rs:44-56 \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":"mila/native/linux/src/device_key.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db1e1cf2066e9dc88de930bcfa8a6d694cb07e5188c8bf22159b96064bf325e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): mila/rust/mila-ffi/src/session.rs:765-785 | mila/rust/mila-ffi/src/session.rs:799-819 | mila/rust/mila-ffi/src/session.rs:832-852 | mila/rust/mila-ffi/src/session.rs:1249-1263 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"363025cc9c08225450b347ccff27ec9a37d9b1e404f613a63a7569a1961e0632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): antithesis/emulation/host/runner.py:164-178 | antithesis/emulation/storage/runner.py:163-177 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bb0b489547e3edd6be414c1c2d4ef6019bddeb7ee5def7f8460622e8ee0977"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): marshall/lib/marshall/editor/token.ex:22-30 | marshall/lib/marshall/ingress/token.ex:38-44 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/token.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65ec49967524e451aeb9909d01cbbae3a56bb91571d08fa2265d118bb0c2411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/vm/boot.ex:23-33 | lilly/lib/lilly/vm/boot.ex:81-94 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/boot.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dcadf21cc29413613aaa0e072844450c77a1a1e346b35c19e0b028ab4378b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): marshall/lib/marshall/agents/skills.ex:248-283 | marshall/lib/marshall/agents/skills.ex:288-313 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/skills.ex"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b538dd1277cbde6359b63cc395afb20fb07669bded811ea96b13d69cc13c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:231-240 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:294-304 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:491-502 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f313bf4ee14a37ec1a60a342759f7651a06eb2f1f5d10d08d21233fe87869"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): marshall/lib/marshall/compute/clone_coordinator.ex:294-318 | marshall/lib/marshall/compute/clone_coordinator.ex:458-486 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_coordinator.ex"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25e48b507a7ad66d941290f4e5a0809e5adf5e15cee3ba8b25f34f8e0dbff40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): marshall/lib/marshall_web/live/admin/audit_live.ex:58-84 | marshall/lib/marshall_web/live/admin/audit_live.ex:130-154 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/audit_live.ex"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033121a935fff370ecbd753f321f361dd2f1551d2d2013e63d7545952a62601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): audi/lib/audi/privacy.ex:40-51 | porsche/lib/porsche/privacy.ex:37-48 | ziggy/lib/ziggy/privacy.ex:35-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/privacy.ex"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b97de8b7f9f68a681a4249af91dd731699673933374ccb2ab7dcad3a55b53d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): elixir/diagnostics/native/spool/src/sys.rs:26-50 | nix/domains/system/otel-guest/receiver/src/main.rs:18-44 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/sys.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d52c25ff0e74fd0f6b3cb88ceb2fe492825adb9ebd220b66d9504d31ab997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lyra/src/agent_cli.rs:189-201 | lyra/src/platform/windows/boot_id.rs:32-47 \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":"lyra/src/agent_cli.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9e80cd385543fe9b1a5a12d74127ee525b86dede18af252f07d535e6efd110"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): marshall/lib/marshall/operations/executor_bootstrap.ex:44-53 | marshall/lib/marshall/operations/git_hub_tools.ex:44-53 | ziggy/lib/ziggy/bootstrap_release.ex:13-23 | ziggy/lib/ziggy/tool_release.ex:14-24 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852f8e2844211cd4ffad8a2b37083835f481e6b9942bc0192e2af5f2d7521f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): marshall/lib/marshall_web/live/machines_live.ex:352-372 | marshall/lib/marshall_web/live/machines_live.ex:376-404 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5208fd1f6d4514bded67154e15b5dac1b7deb3d6f49276d602d2f2cba91bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lyra/src/bin/overalls-trustd.rs:457-475 | lyra/src/bin/overalls-workspaced.rs:34-51 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2111a7cb71b9e6810ab46cbda2bb9bc79e999be37aaba87dea9a860185ff5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): antithesis/workload/control/delivery.py:185-199 | antithesis/workload/control/delivery.py:203-216 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/delivery.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f517b8c16d3d25d5d48373e23ff23ce54933bf31bc22afb38bc7f364705d0c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): antithesis/operator/guest_witness.ex:426-438 | antithesis/operator/guest_witness.ex:731-746 \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":"antithesis/operator/guest_witness.ex"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d307be0fa4dd052c2f91496f8e3fc9e35ddbbd04b42e3e1f2cb97b8e734dec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): susan/lib/susan/operator.ex:69-88 | susan/lib/susan/operator.ex:93-114 | susan/lib/susan/operator.ex:119-141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/operator.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb3132146fe158a7242f64fe227a78cd3af24127a7a980ce19a1e501391bf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): antithesis/workload/repository/client.py:54-72 | antithesis/workload/repository/client.py:75-92 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/repository/client.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"144d759614fe4cf6d570ffba53ab077f2cfdd9654589834fd9db435e65c12a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): antithesis/fixtures/origin/server.py:122-141 | antithesis/verification/schema.py:84-99 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/fixtures/origin/server.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e3fc8d65f9ed189a695a76b48134f1f4c281900c72d47ae296b0063fd5902f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:52-62 | lilly/lib/lilly/host/ownership.ex:59-70 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99fc2d7075b1d4caecedeb106cd948ceb045a9fbc553af3221d78c4852c7230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lilly/lib/lilly/host/zfs_dataset.ex:663-672 | lilly/lib/lilly/host/zfs_dataset.ex:1346-1359 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5e19e3c9c2d6293c42502d454383ab69d0d0d90d0382b422e3179e597c981f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): marshall/lib/marshall/compute/relocation_destination_revocations.ex:72-94 | marshall/lib/marshall/compute/relocation_key_retirement.ex:70-89 | marshall/lib/marshall/compute/relocation_revocations.ex:70-92 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:74-97 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_revocations.ex"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6ebe14d8d0f12f84509b31170fe59dffaedfa96c3f39b2e6587819f90fb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): marshall/lib/marshall/operations/galileo.ex:15-28 | marshall/lib/marshall/operations/peach.ex:15-28 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"857fd52b0743a9bc664717eb2135191b9c96a99295ced7df8cf7f901eae6e8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): mila/rust/mila-ffi/src/android/terminal.rs:21-42 | mila/rust/mila-ffi/src/android/terminal.rs:56-80 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af2fa05f4a2de39ad825edc0f6a37c1b47f767767b46a44895dc1f8b008b5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): mila/native/linux/src/session/commands.rs:28-50 | mila/native/linux/src/session/commands.rs:473-493 | mila/native/linux/src/session/commands.rs:500-521 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c46193cfacdd5dfde2b8d033519334eb404de5ed1c9ad671b2d875d1d7aff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/uuid.ex:9-15 | ziggy/lib/ziggy/request_id.ex:10-16 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/uuid.ex"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5632508c369b608188a0f501303ba486de2714106b066831f26314b8b4bc59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): marshall/lib/marshall/ssh/commands.ex:1402-1420 | marshall/lib/marshall/ssh/commands.ex:1429-1453 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/commands.ex"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c0c4ba0d68158bbd6cd2af2ae1e210824ee1614ea08f86b154550af6c00c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mila/rust/mila-ffi/src/android/validation.rs:187-202 | mila/rust/mila-ffi/src/android/validation.rs:211-226 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/validation.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8d0580dc15248eda40b7f72a67605d1edd9ba4e66624c8cf4be73ccdb32e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): mila/rust/mila-ffi/src/session.rs:1084-1110 | mila/rust/mila-ffi/src/session.rs:1157-1184 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8b92876360c9c5dabfff1d9b0fc715fdccd93a6f9ab7f5d2df1a9a09f303e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): antithesis/emulation/guest/runner.py:194-205 | antithesis/emulation/storage/bootstrap.py:40-52 \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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ecac9e79827aab5c4df54f97ae1feffe987b19ff0b03c25ebccabc64124746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): antithesis/emulation/host/runner.py:33-55 | antithesis/emulation/recorder/runner.py:32-55 | antithesis/emulation/storage/runner.py:35-55 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d0fc46b73b530bbaeae87072ec1a7cfd39f0ed7fdea02ee611d0c13211e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lilly/lib/lilly/transfer/checkpoint_transfer.ex:401-418 | lilly/lib/lilly/transfer/receiver.ex:138-158 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9170728d53bad895e91d34a4d391e9ab9b57896529a0cff09e31d26d362a4088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): marshall/lib/marshall/agents/attachment_tool.ex:69-86 | marshall/lib/marshall/agents/attachment_tool.ex:152-169 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/attachment_tool.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe088a7545b764485dd379c960a13d9786593f71d7981d4607eb3f62c8abe29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): nix/domains/artifacts/vscode-web-broker/src/boot.rs:13-23 | nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:182-193 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:272-288 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/boot.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5149ad9292fcec41e0236ebaef6fefbfba414a60608c443b4775e38d1cc6c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): antithesis/emulation/recorder/bridge.py:43-59 | nix/domains/system/backups/common.py:54-73 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/recorder/bridge.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ac43cfd297a8462ec4f173ab15631fde1ae0a48f9a907f3d5773a83eaa2b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): nix/domains/system/backups/common.py:77-90 | nix/domains/system/otel-guest/browser_journey.py:255-273 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/backups/common.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3873ea585f3d6c159115dd7430675813ceabbdbd86ec55ffff342ddebff5fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lyra/src/sys/windows/net_api.rs:83-106 | nix/domains/artifacts/terminald/src/sys/conpty.rs:77-95 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/net_api.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b524a1b19da833c1acfb5e733c6d572e5de5ade176a9e780adb3774885284d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): mila/rust/mila-ffi/src/session.rs:1887-1902 | mila/rust/mila-ffi/src/session/watch.rs:304-317 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b5c2359c6890f5040483d6b22575b39d061de60017c976b5bbe87646bdbd62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt:27-34 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt:51-56 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaMachineCreate.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac176dd8b92d4963311a4f241c234453dd09c8df23c34c4c066b5c59bf2f5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): nix/domains/system/auto-update/resources.py:412-424 | nix/domains/system/auto-update/runtime.py:318-329 \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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef634c4c162191a5205109c8b5baf3024fb20500a5bb043e888e562b37276dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): galileo/lib/galileo/http.ex:28-38 | ziggy/lib/ziggy/http.ex:28-40 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/http.ex"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7396b65d34d43a8ec2750c98ea1a48075184319f7cc26ffb49001058603467"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): mila/native/linux/src/porsche_results.rs:113-135 | mila/native/linux/src/porsche_results.rs:217-235 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/porsche_results.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040f5dbf6115b3fc1e6a762441e21f96b8acbd4905737eefe0bc6774059b8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): antithesis/workload/access/oracle.py:108-120 | antithesis/workload/access/oracle.py:138-153 | antithesis/workload/access/oracle.py:156-171 | antithesis/workload/admission/capacity.py:126-138 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/oracle.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b929ded9dae2e75f03a332388efff0b5841faaeba6000528835e199596a3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:221-229 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:334-345 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:375-384 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:390-399 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"11347333033ac5ff3b821f826d7828f8faa223ff1bcfde2cb3c97b28d0de8779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lilly/lib/lilly/vm/driver.ex:66-82 | lilly/lib/lilly/vm/driver.ex:120-136 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c8ff19ce354006ddc5a1fd6fa69c6cf5428cf54bdd47de604c4cb47ae8443e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): marshall/lib/marshall/compute/relocation_coordinator.ex:255-267 | marshall/lib/marshall/compute/relocation_coordinator.ex:276-288 \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":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"807639cdc8948559b391f4e969e5c3ec9777e80d9bd269a2d0c469813ae9e1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): marshall/lib/marshall_web/live/resize_live.ex:143-168 | marshall/lib/marshall_web/live/resize_live.ex:172-197 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/resize_live.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06c6ae9e316b9c24591eeadc3076eae48511f0be33c77839efabcc0e8ce5a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): mila/windows-dotnet/Interop/RustNativeLifecycle.cs:315-325 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:329-339 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dabc653f271e891f0bd2a832dce4aa29e89fab40f30bf8e92d500c17d03d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lyra/src/bin/overalls-ssh-sync-windows.rs:262-275 | lyra/src/bin/overalls-ssh-sync-windows.rs:277-290 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-sync-windows.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2112c1b299d008e1fecaf182aabe7d7defc47373776dd0b8ff4bc60b544ae5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:9-28 | nix/domains/artifacts/guest/native-kernels/illumos/extract_viosock_lifetime.py:9-26 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"404e6dba26588efe5d0382ad42a63bac64bdc8e10e51505d9de2455a776ed603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lilly/lib/lilly/transfer/key_runtime.ex:14-29 | lilly/lib/lilly/transfer/source_runtime.ex:26-41 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08548a2cab6164859d174638953ad7a45cad353fa74238d78da6314e1e21231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/ssh/commands.ex:364-368 | marshall/lib/marshall/terminal/authority.ex:103-118 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/commands.ex"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e91dd5a6050d626d7a1ea174191e250f627624b74b061f1f470a291ee279cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): marshall/lib/marshall_web/gettext_interpolation.ex:13-31 | porsche/lib/porsche/gettext_interpolation.ex:13-31 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/gettext_interpolation.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8313474f3e7235ea792acf51e604472d788ddf6af3d08597472db9778f2880"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): protocol/lib/overalls_protocol/workload_bundle.ex:237-264 | protocol/lib/overalls_protocol/workload_bundle.ex:281-308 \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":"protocol/lib/overalls_protocol/workload_bundle.ex"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a049d00da58b59db4767c3890ee2e2cff94ab9e8fd3968d9dee7d9fe9707ac94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): audi/scripts/invalid_boot_probe.exs:86-102 | lilly/scripts/invalid_boot_probe.exs:79-93 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/scripts/invalid_boot_probe.exs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4acf81d59bd691417e8bb7b2ef19ad399751bdc0d1a707b2041e9dfb41fc50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): marshall/lib/marshall/access/sharing.ex:97-116 | marshall/lib/marshall/threads/sharing.ex:95-114 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7a0631eb617b98b8a71accd9484c95526ea99f9446c75eead601fc010b5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): audi/lib/audi/http/authority.ex:43-51 | audi/lib/audi/inception/authority.ex:48-56 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/authority.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee7bae93f7783dd801bacee860ca05a96b7c765013e23b823dab94e9d038aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): audi/lib/audi/privacy.ex:72-91 | porsche/lib/porsche/privacy.ex:63-78 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/privacy.ex"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d081bffa9eb13f5dba28e80d8b15a3ab425625f90ca2cd13e8de5fc42633e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lilly/lib/lilly/backup.ex:326-348 | lilly/lib/lilly/transfer/clone_copy.ex:456-472 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/backup.ex"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8546668ae6f9911400bff0e23ebd795a9b5b7796cfae8f6784d43d1dda9b840f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lilly/lib/lilly/ingress/backend.ex:12-28 | lilly/lib/lilly/ingress/backend.ex:41-63 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/backend.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b71fc9fe313497985b646e6a0280777a9d9ac646a2d95928262b5a8e765597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): marshall/lib/marshall/agents/executor_session.ex:611-633 | marshall/lib/marshall/agents/model_calls.ex:370-391 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b905dc69022cec59ca547593b687d91db6a2a063e5820746a26ab3680161f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): marshall/lib/marshall/compute/relocation_deletion.ex:131-140 | marshall/lib/marshall/ssh/guest_access.ex:313-322 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_deletion.ex"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b445b7f67439114c0ab36a72cea1f8edf1f41b630aae50d181f345904a25f7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): antithesis/workload/admission/oracle.py:68-84 | antithesis/workload/control/oracle.py:45-57 | antithesis/workload/control/oracle.py:60-79 | antithesis/workload/control/oracle.py:156-171 | antithesis/workload/terminal/oracle.py:80-97 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/admission/oracle.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5aa5193022950e74ea04282631ec7ba1fd3bb9b6f1ee2d39179879bf7d3f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): nix/domains/artifacts/terminald/src/session.rs:1237-1249 | nix/domains/artifacts/terminald/src/session.rs:1271-1290 \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":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0fcac86a25e726d5ad759b0f5b319e216f755d092ab20b86c1bd90312e8549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): antithesis/workload/control/oracle.py:106-120 | antithesis/workload/satellite/editor.py:166-178 | antithesis/workload/terminal/oracle.py:100-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/oracle.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ad9257ae38d428e756a99c4dbcc4d54e187cc9bad871f86ee7337009609e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lyra/src/config.rs:144-154 | lyra/src/ssh_certificate.rs:19-29 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/config.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e0dd67a0b45ed416807c43f34721077825ae30444ba5efcc8cfe791e1c7227"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ziggy/lib/ziggy/agent_worker.ex:193-207 | ziggy/lib/ziggy/http.ex:576-590 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/agent_worker.ex"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8a0e985c63e6d2a55cdef532367431ddcec28307e5edac06d735b8865a246f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lilly/lib/lilly/host/limits.ex:81-93 | lilly/lib/lilly/host/limits.ex:143-155 \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":"lilly/lib/lilly/host/limits.ex"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e5a19e9bdc533ba2bf14c83ebbc03066197e09ca721431bdcbb03fa2f31c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): marshall/lib/marshall/access/sharing.ex:12-32 | marshall/lib/marshall/threads/sharing.ex:14-37 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e61fc5d6b44cffa22fd391151f71d610706413df4503c02142fbf681acbad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): audi/lib/audi/ssh/proof.ex:64-77 | porsche/lib/porsche/ssh/proof.ex:66-80 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/proof.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"def4de85f6dc31b4cf4cfc73f3765b3d8cf01d25195e3a33fd4e806411f0dbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): galileo/lib/galileo/github/lfs.ex:26-39 | protocol/lib/overalls_protocol.ex:265-274 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/lfs.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02666e44594dd0be527dc1e3848100f57df3f3eec360987168f0f4726ccb8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): marshall/lib/marshall/notifications/device_actions.ex:120-132 | marshall/lib/marshall/ssh/key_actions.ex:89-101 \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":"marshall/lib/marshall/notifications/device_actions.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"026569a975b868d6adb323ba5689b0cb9be1ed5c7fc5b0163afc3018300898e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaApplePush.swift:59-69 | mila/native/apple/Sources/MilaNativeUI/MilaDeviceSigner.swift:131-144 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaApplePush.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e8b502ee1323a86e633c6f3c0d425764239557e704538aedf81a6c31272564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): audi/lib/audi/http/proxy.ex:233-243 | audi/lib/audi/private/front.ex:296-306 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca79aaccfe8893a17866f0c2ef0749ed8e41a0ff7c2081543c08e78de3105836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): audi/lib/audi/slo.ex:156-168 | porsche/lib/porsche/observability.ex:275-292 | ziggy/lib/ziggy/spool.ex:236-248 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d19f47df704eafef996bca0bc907d08bfddbcff6854786a04b5f65c15b971e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): audi/lib/audi/status_server.ex:54-71 | porsche/lib/porsche/status_server.ex:42-55 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/status_server.ex"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9b8a7af960f721db9ae93a69f845a86b2461a297c6d07d41095c9f40cd589e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lilly/lib/lilly/host/image.ex:309-321 | marshall/lib/marshall/artifacts/tool.ex:179-188 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image.ex"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d1bb134bcf24cca1defdcf7c06e940100d8f37e9edb617418066a8eeca27d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/host/zfs_dataset.ex:217-223 | lilly/lib/lilly/host/zfs_dataset.ex:227-233 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d85704a7c23af1878a6a350ed292ba4962eb19164da70d72c1831e5024719a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): mila/rust/mila-ffi/src/android/terminal.rs:367-386 | mila/rust/mila-ffi/src/android/terminal.rs:411-424 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dc81873693d55b4627157c0f89ca7e1652ae98f9845aa5da032ee643ba452c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:166-176 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:290-303 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0435ae3f40e09931ed1d8ff1c5de2260388a9c763e03a575cec4a55a8532219"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): antithesis/workload/satellite/authority.py:14-29 | antithesis/workload/terminal/oracle.py:114-128 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/authority.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0633ec15b5d8020728bf7b17cc80d5099770aa40d97472edbc09ac597500fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lilly/lib/lilly/terminal/vsock.ex:189-198 | lilly/lib/lilly/terminal/vsock.ex:219-229 | lilly/lib/lilly/terminal/vsock.ex:261-270 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/vsock.ex"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee20c7b1d1a1b346f266f73becde87d38da0268631d1cb59d3161745dd4d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mila/rust/mila-runtime/src/screen.rs:315-323 | mila/rust/mila-runtime/src/screen.rs:325-333 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6430cbbd2a48a3bb88bda78b8c4315923716e5f09212292d9c8cb9d110f944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lilly/lib/lilly/host/zfs_dataset.ex:303-315 | lilly/lib/lilly/transfer/import_cleanup.ex:201-208 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e29d081a7c50fc775cc581d7d9f65110b6931b3760279ef065e077609b5c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lilly/lib/lilly/transfer/key_runtime.ex:143-160 | lilly/lib/lilly/transfer/source_runtime.ex:176-197 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a237e0eff056e6ca524eefbb348e30f1ca045492ceee02d903a818f965e50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): marshall/lib/marshall/editor/authority.ex:191-207 | marshall/lib/marshall/ingress/web_streams.ex:106-117 \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":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e252313dea615d96295cd9cc1d6e29a36baa870252af5563e47339da953fc484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/ingress/acme/jws.ex:59-66 | protocol/lib/overalls_protocol/inception_public.ex:47-54 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/jws.ex"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d7c9f75354bba149217f91a820d342bcfe372a7637058ce0f35c6114e22ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): mila/native/linux/src/connection_profile.rs:62-70 | mila/native/linux/src/deployments.rs:233-241 | mila/native/linux/src/device_key.rs:38-46 | mila/native/linux/src/notifications.rs:42-50 | mila/native/linux/src/persistence.rs:126-134 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/connection_profile.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"534cf5aff08417d99790bf416eaffe8361cba44a9a793f76578148bb772a775d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): mila/rust/mila-ffi/src/session.rs:1520-1530 | mila/rust/mila-ffi/src/session.rs:1542-1553 | mila/rust/mila-ffi/src/session.rs:1612-1628 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b42e3807b8ec1b11e6b8a755c95910f9a1448a555121aa30a9039d3abd4cc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): antithesis/integration/fault_worker.py:202-210 | antithesis/integration/witness_worker.py:107-114 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/integration/fault_worker.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a71de5129fce3907a44b8a63f53bced3e1373dbfe7f1e0539fe42de0bfa1709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): audi/lib/audi/control/client.ex:142-152 | audi/lib/audi/control/client.ex:457-469 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c101bff56097e79bda5efeea0e2dba0d2ba59599b15c02548464b17ccd267"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): audi/lib/audi/slo.ex:121-137 | elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:151-167 | marshall/lib/marshall/slo.ex:169-185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f056e8427c2ba3c5aa28663c3703aa0075d79e52cc4deb6b5dc9ea29d8de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): galileo/lib/galileo/github/response.ex:82-91 | marshall/lib/marshall/agents/context_manifest.ex:144-153 | marshall/lib/marshall/agents/context_manifest.ex:189-198 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/response.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caea7e8540b9aa53504eeab728caf09decdf892f166a22c52d44d28b08e3169"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/network.ex:276-286 | lilly/lib/lilly/vm/driver.ex:2271-2282 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network.ex"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad275fef83592a2d0186cce13e2d7a2431d90b0bc96e9923c6f684f7236283c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lilly/lib/lilly/transfer/permit_journal.ex:411-416 | lilly/lib/lilly/transfer/permit_journal.ex:433-439 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"abde6bdd837cf720ceaf84fe833c21d8c2406d70dae2abae3501cfbcafc923fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): protocol/lib/overalls_protocol/ingress_route.ex:53-77 | protocol/lib/overalls_protocol/ingress_wake.ex:11-19 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/ingress_route.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcedbb1231f7e6f2a4428ec7e205bebe4f02fa8cbe8b17a7576b0daf25f7c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lyra/src/guest/ssh_platform.rs:134-151 | lyra/src/guest/ssh_platform.rs:157-182 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/guest/ssh_platform.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75721afc193dcb0ad90a28bbce8cec06d71ec09093e792abc2f24861d7b589e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lyra/src/telemetry.rs:113-128 | nix/domains/system/otel-guest/receiver/src/slo.rs:254-273 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/telemetry.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7df29845a7cb32a3b71d75795efc9b3172d70df3b04012c576cc0a65ad19b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:27-36 | lilly/lib/lilly/host/counters.ex:32-41 | lilly/lib/lilly/host/mount_table.ex:40-55 | marshall/lib/marshall/compute/enrollment_request.ex:68-77 | protocol/lib/overalls_protocol/integration.ex:267-276 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e13b9155f32ff70449f3f265c741a7919137ee3602d82fa3e08c571fe773ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): audi/lib/audi/config.ex:252-260 | porsche/lib/porsche/config.ex:69-77 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/config.ex"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06662ae3a5cfd47ff04d56295865c1c97f154b7f7a002cc0f2c61faebea3965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): audi/lib/audi/http/editor_assets.ex:22-33 | galileo/lib/galileo/github/lfs.ex:66-73 | marshall/lib/marshall/editor/releases.ex:21-29 | protocol/lib/overalls_protocol/terminal.ex:638-645 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/editor_assets.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c18e03246ab1b21684bc1bea06f5442bb71c228372ddd72c5358e9b9d349abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): marshall/lib/marshall/accounts/scim_retirement.ex:88-107 | marshall/lib/marshall/accounts/scim_retirement.ex:222-235 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/scim_retirement.ex"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ae27f8862b11d8c45fd1402117ac9d0e2dabd3113574d382b43c8da6c1e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mila/native/linux/src/session/mod.rs:104-113 | mila/native/linux/src/session/pty.rs:140-160 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a19caa2e1740a3efc5b9fa738d0994bcc36089d9bf153684b324f4c84e67ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): antithesis/emulation/storage/runner.py:67-78 | scripts/egress_acceptance.py:113-124 | scripts/galileo_acceptance.py:75-86 | scripts/porsche_acceptance.py:276-288 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/storage/runner.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"74483b8dcc69a9ab7b2387bf957ef34b10d4cdd0ba30e46e07586792f4b9bb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nix/verification/hegel/python/hegel/statemachine.py:137-145 | nix/verification/hegel/python/hegel/statemachine.py:148-162 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/verification/hegel/python/hegel/statemachine.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"78de868c7d489c18d329cd858ff0620b81a943879996d869bff69b572b84a3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): audi/lib/audi/dns/server.ex:146-167 | brady/lib/brady/listener.ex:96-117 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/server.ex"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3db86b1a86ce193b9bc2166fbad417ca929924d3afdecb0f99963f042e7154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/terminal/guest.ex:92-98 | lilly/lib/lilly/terminal/guest.ex:189-197 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/guest.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c5d39d5a0c241b5540f22e0414146901148e8bc03c28698a7a84e2db2f929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): susan/lib/susan/config.ex:129-133 | susan/lib/susan/config.ex:143-147 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/config.ex"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a568eac3ba1b8d5f83d1e37a19ac345dab92f3becccb17f155f3a619130ff7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lilly/lib/lilly/control/runtime.ex:414-426 | lilly/lib/lilly/control/runtime.ex:434-445 \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":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b4fffbb6920e832ae3aebcded3004e8b511eaf01fbf92895f4955dfd6ebc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): marshall/lib/marshall/artifacts/blobs.ex:106-120 | marshall/lib/marshall/artifacts/blobs.ex:125-143 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/artifacts/blobs.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9604dc17936007b67b5f6c0ab5d5b7106fc890723bddfa11d8e37f0306df2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): mila/native/linux/src/session/pty.rs:217-230 | mila/native/linux/src/session/pty.rs:232-245 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/pty.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc95613312469b72736578e37b64e16c040caca3a4f35c62fafedfb10ec679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:629-635 | mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt:646-652 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab71efe273b93801653a343048be79c35e8d10f1f43b7c59b8ed591729369fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lilly/lib/lilly/control/runtime.ex:1304-1315 | lilly/lib/lilly/control/runtime.ex:1325-1337 | lilly/lib/lilly/control/runtime.ex:1351-1364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"579e8a18efe3f93948d36083ccdaa2a81fe4bae61d1e3754ba27fac6c96c6205"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): lilly/native/ingress-bridge/src/cli.rs:22-32 | lilly/native/launch-guard/src/lib.rs:71-81 | lilly/native/source-export/src/cli.rs:15-23 | lilly/native/transfer-stream/src/cli.rs:21-32 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/ingress-bridge/src/cli.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5559178c47397de2d1d889318af170bc54f266fcf492be82cfa949725c13b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): marshall/lib/marshall/scim/oidc.ex:259-266 | marshall/lib/marshall/threads/provision_worker.ex:160-166 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/scim/oidc.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d0d69e1f35b37ef51e95e889e77d39e8f33e5cc813d3f3d2370938ddb34961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): mila/native/linux/src/journey_checks.rs:340-355 | mila/native/linux/src/journey_checks.rs:378-395 | mila/native/linux/src/journey_checks.rs:398-409 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/journey_checks.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097507c64b9221fb97d8d16cfaae23efaf17013ecc8885c25d1c1f5ca8c8c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mila/native/linux/src/session/signer.rs:77-95 | mila/rust/mila-journey/src/main.rs:222-236 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/signer.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"39578ec00b6a1062629ed19d2d6aa9b59d2d2d607c50c5f0e7267d895e1df89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): lilly/lib/lilly/control/runtime.ex:1619-1627 | lilly/lib/lilly/control/runtime.ex:1647-1656 | lilly/lib/lilly/control/runtime.ex:1677-1687 | lilly/lib/lilly/control/runtime.ex:1708-1718 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7247710f12d5f4638759453acfe3b52af96e05850a859ceec4741a99087dd15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lilly/native/image-copy/src/materialize.rs:24-38 | lilly/native/image-copy/src/materialize.rs:64-78 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/image-copy/src/materialize.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ca4df7c815e57820c66b5b37bc0d8067fa8e423fcc1a30ea03002623dbd7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lyra/src/bin/overalls-native-bootstrap.rs:5-17 | lyra/src/bin/overalls-native-grow-root.rs:5-18 \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":"lyra/src/bin/overalls-native-bootstrap.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee91f95434aa0f2b4b74c73a46c88aeaaf01e2133224c4abc4bf5844b8fd759c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): marshall/lib/marshall/compute/host_reports.ex:23-46 | marshall/lib/marshall/compute/host_reports.ex:51-79 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/host_reports.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3eec2c836daca0f38c4b6d60052f0d663faacc007be05d7303f132b1086cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall_web/live/admin/audit_live.ex:158-166 | marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:178-190 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/audit_live.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef2307fcfee35c93058e987982fbc9cba45123ac2264001cbd7cb7517310de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): marshall/lib/marshall_web/live/admin/workloads_live.ex:25-41 | marshall/lib/marshall_web/live/machines_live.ex:247-259 | marshall/lib/marshall_web/live/machines_live.ex:332-348 | marshall/lib/marshall_web/live/machines_live.ex:412-430 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/workloads_live.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ab724952e1d885b96ba14148640a05ed475188fc8df0dd1689524b3ff713c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): buck/ci_failures.py:102-115 | buck/ci_failures.py:119-127 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"buck/ci_failures.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e20994d0d430fbc2c42dcadf06cdc2fc830dd37cf1c3f47233a78f2587e8155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): lilly/lib/lilly/control/runtime.ex:1387-1401 | lilly/lib/lilly/control/runtime.ex:1447-1456 | lilly/lib/lilly/control/runtime.ex:1480-1490 | lilly/lib/lilly/control/runtime.ex:1514-1524 | lilly/lib/lilly/control/runtime.ex:1548-1559 | lilly/lib/lilly/control/runtime.ex:1583-1595 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3761fbdfc1ad0870550a501f9fa9216f595ce2341d1affdc3f7d7cbc44e779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lilly/lib/lilly/observability.ex:35-47 | marshall/lib/marshall/observability.ex:55-70 \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":"lilly/lib/lilly/observability.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d0a25df329195aa903ee91130b037c24c3237fac232484a8dab932f37f90fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lyra/src/bin/overalls-ssh-authorize.rs:71-76 | lyra/src/guest/ssh_roster.rs:104-109 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc25f0c63fb6726f24125344343e14d4d11b7ee9d8c1c47d0232fe71fe0f2a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lyra/src/sys/socket.rs:147-159 | lyra/src/sys/socket.rs:166-183 \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":"lyra/src/sys/socket.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6645cbc2158f52aef0bae71bfe40ec3004081d134ce7318ac71bce5c7ffae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/ssh/token.ex:23-32 | porsche/lib/porsche/connection.ex:214-221 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/token.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23fba339903f561d364f7e3b5a56023ea56520f0e5c96c056c61692612aced1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/terminal/host_stream.ex:315-324 | marshall/lib/marshall/terminal/host_stream.ex:403-411 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/host_stream.ex"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f699b4aef36bca4a8e6c87059c01e7e823d42c4e2daf9cc9d9188178eb7933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): marshall/lib/marshall_web/live/threads_live.ex:401-410 | marshall/lib/marshall_web/live/threads_live.ex:450-461 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"047c2c6e40661635a255202090e1ff6b8d50e5481df3613c340e1d39407cba43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): susan/lib/susan/provider/fcm.ex:16-32 | susan/lib/susan/provider/wns.ex:21-42 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/provider/fcm.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f39c98a81a7a2b8b12db8b3c7c9a0806769884d6e5803d788d17b02b4e28163"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): antithesis/workload/recorder/client.py:139-151 | antithesis/workload/recorder/client.py:163-173 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/recorder/client.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"32522935a919f272d292719dee67a4e63b4cf2ad66aa00a40bb9ba14cc07c09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): audi/lib/audi/privacy.ex:6-18 | porsche/lib/porsche/privacy.ex:7-19 | ziggy/lib/ziggy/privacy.ex:7-19 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/privacy.ex"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b83c89c5a4a73a21ce0c5c1fad17e8300410d2d55d71040012fc424d5c1a723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/terminal/stream.ex:248-254 | marshall/lib/marshall/terminal/host_stream.ex:154-163 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f228b206482d409c1772985ae077acdcb7ce419342304bdff9da73769b523f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): audi/lib/audi/slo.ex:176-189 | marshall/lib/marshall/slo.ex:227-238 \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":"audi/lib/audi/slo.ex"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3ab8a10c9418a7038adad76e275a5c9f0bf3ad2e9346d6c4a017ec310bcb22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lyra/src/sys/windows/winsock.rs:216-225 | lyra/src/sys/windows/winsock.rs:228-237 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/winsock.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"215c57012d4c23862a3243f109c7381a5e4adbc56de5c2e4a9392c82099d246b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): marshall/lib/marshall/compute/admission.ex:340-356 | marshall/lib/marshall/threads/coordinator.ex:419-434 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85a88b777195f7446a10f16bfe44b22f61b7a26e51bb983e7241ac663dff64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): marshall/lib/marshall/editor/authority.ex:536-559 | marshall/lib/marshall/ingress/web_streams.ex:374-390 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9816ea00041c6ae7724efbe4eee473a9f0deaabd243d36448147cdc1c477f53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): marshall/lib/marshall/galileo/credentials.ex:53-69 | marshall/lib/marshall/inference/credentials.ex:104-126 | marshall/lib/marshall/peach/credentials.ex:53-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f156da94acf612bbf499baef13915b1d7afe0f8303e59563e8b41a3b4b4051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): nix/verification/hegel/python/hegel/generators.py:328-336 | nix/verification/hegel/python/hegel/generators.py:340-348 | nix/verification/hegel/python/hegel/generators.py:352-360 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/verification/hegel/python/hegel/generators.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c596d9090b8e16bee6c3e65254e3d4adb640267864d129ae62e319566a2fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/control/runtime.ex:327-333 | lilly/lib/lilly/control/runtime.ex:378-391 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5fe61d3f601d80e764cbaf2868607e0c6ba653962fb7f7e5c6d7bebcd1b874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lilly/lib/lilly/host/zfs.ex:966-972 | lilly/lib/lilly/host/zfs.ex:1235-1240 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd6be5aeebc073bf52005c29bb01c5bd05e727bc1e3a67f07695b5c3b75cc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/control/socket.ex:86-94 | marshall/lib/marshall/control/socket.ex:98-106 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/socket.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70485fe4ea3950a212f515007f58dff261dd86eae77badeb3d5f5c55a37b79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): marshall/lib/marshall_web/live/account_live.ex:160-180 | marshall/lib/marshall_web/live/admin/users_live.ex:32-55 | marshall/lib/marshall_web/live/admin/users_live.ex:59-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4ab068f01e7d926ceec4144c983c81c7c2d4be8bc5c598a7882eb16666277c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ziggy/lib/ziggy/slo_checkpoint.ex:133-141 | ziggy/lib/ziggy/spool.ex:365-371 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/slo_checkpoint.ex"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a64143f2dc60ec668203acb68ed13242f2df5294e405b28eb9a1e4567005b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:323-331 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:505-513 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:516-524 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"923e9f66b8258c4baa1d838821115cc128a8af671a87244713ae24d8d9efedaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:222-230 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:243-251 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:304-319 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70891a519a006ec88ac13b2c73406ff56f3975a218c58ddaadcea1194a0249a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): audi/lib/audi/config.ex:388-394 | lilly/lib/lilly/host/image.ex:356-359 | marshall/lib/marshall/operations/private_files.ex:89-92 | porsche/lib/porsche/config.ex:102-108 | susan/lib/susan/credentials.ex:84-90 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/config.ex"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b06601e7cc4000081b485f390d046099ddd52180b1b2cd161a767b58526060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): audi/lib/audi/http/browser.ex:103-107 | audi/lib/audi/http/editor_browser.ex:103-107 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a34e054de2b05270718aab2ee4abfabcb689dab9c00262447912c56185db0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/notifications/device_actions.ex:104-112 | marshall/lib/marshall/ssh/key_actions.ex:26-34 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/device_actions.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f4d7e9690b1cd492e1fb3ee19af6e81b5c8dd46c8fd003d3f765cb35cdada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): marshall/lib/marshall/operations/galileo.ex:33-40 | marshall/lib/marshall/operations/inference.ex:45-52 | marshall/lib/marshall/operations/peach.ex:33-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe4d65efb77a6e30cddaf9388bf727781b48370b055bf6e179ca960ff4da05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mila/rust/mila-transport/src/ssh.rs:565-576 | mila/rust/mila-transport/src/ssh.rs:578-589 \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":"mila/rust/mila-transport/src/ssh.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"35990ca8b1230ae38a2aacb09889d86f5a7add13cabc7ad27bb9b11759a63d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:233-240 | mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs:258-281 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c604a69dd7bdab69fadeb665fac58e567edc09f6edc0eb7eb62637984308e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): enrico/lib/enrico/http.ex:123-128 | enrico/lib/enrico/manager.ex:259-265 | protocol/lib/overalls_protocol.ex:164-165 | ziggy/lib/ziggy/request_id.ex:20-25 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"enrico/lib/enrico/http.ex"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9059d8d6eded73c75aec83119c9356c0ad88638bab65c16eb8e7a179f21616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): marshall/lib/marshall/ingress/control_requests.ex:180-190 | marshall/lib/marshall/ingress/control_requests.ex:194-204 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/control_requests.ex"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c0f226a2efc0dd5e6d9d8a3da745bc15a837ba47f955a98e1cae6b0c2547cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): marshall/lib/marshall/redaction/coordinator.ex:205-212 | marshall/lib/marshall/redaction/coordinator.ex:216-223 | marshall/lib/marshall/redaction/coordinator.ex:227-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1758b92913a4dbb29ca9de93189edca4377d45f7176abc576c4dffd997f4b8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/rust/mila-ffi/src/session.rs:1304-1320 | mila/rust/mila-ffi/src/session.rs:1337-1356 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"869aa272f6402663f523d9986ef7010da1bdd536c8c9e2aa58c3ccae6459d3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): protocol/lib/overalls_protocol/web_socket/connection.ex:165-182 | protocol/lib/overalls_protocol/web_socket/connection.ex:186-198 \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":"protocol/lib/overalls_protocol/web_socket/connection.ex"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbb7efa84c7996490c4971ad636deedceef80ab9711d88eebfef16772f17058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): nix/verification/hegel/python/hegel/generators.py:399-412 | nix/verification/hegel/python/hegel/generators.py:438-448 | nix/verification/hegel/python/hegel/generators.py:452-462 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/verification/hegel/python/hegel/generators.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8162d06d23eea42efb78d5086e52aa4eb3626f239b90ff9f4fc824c3a45979ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): galileo/lib/galileo/github/response.ex:95-100 | lilly/lib/lilly/transfer/import_journal.ex:269-278 | protocol/lib/overalls_protocol/github_tools.ex:59-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/response.ex"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"148adcea01168a65c5d2243898d7e85f6994e459a91dd8a83e782e7219c7ba92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): marshall/lib/marshall/notifications/device_actions.ex:26-33 | marshall/lib/marshall/ssh/authority.ex:16-26 | marshall/lib/marshall/ssh/key_actions.ex:13-20 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/device_actions.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c73fdce45e1ee606285c9182fbdd2270225e360aab23b2ad4032493aeee222a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/teams/coordinator.ex:367-374 | marshall/lib/marshall/teams/coordinator.ex:378-385 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/teams/coordinator.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"840bfb4f7b892963c8e5b67e52cb133d16ce01cfc468d48c8abb6280edaf9370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mila/rust/mila-ffi/src/validate/terminal.rs:12-27 | mila/rust/mila-ffi/src/validate/terminal.rs:39-54 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/validate/terminal.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5092bdfbb8ccf4ae494e9dad0af9dded59ebd5641f5325646f7473d215401361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): antithesis/workload/access/browser.py:437-446 | antithesis/workload/access/browser.py:462-477 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/browser.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"651fea17d2b83a114e3f77aa672e599e7e2125bf25187032a2fb019b80545a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lilly/lib/lilly/clone/effects.ex:416-424 | lilly/lib/lilly/transfer/receiver.ex:181-189 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f307d3fd45e07df3adc94730199a69f0924183360080a456403fab0268f63ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): antithesis/workload/control/dispatch.py:58-68 | antithesis/workload/control/host_sessions.py:126-134 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/dispatch.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f36548cb5bc277c0c6262f598c3d846b21d9dd16cafe4d21160b3f0ef46674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:590-596 | mila/windows-dotnet/Interop/RustNative.cs:613-619 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"591d93aa177d7fbc34b65716e0fe4b0e80ec5deac79ef8139282268321a1e2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): audi/lib/audi/slo.ex:84-94 | marshall/lib/marshall/slo.ex:129-138 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289730f49295a9a7860bc0eef657c02f6b59fb9ce6c726e1550b9467805997e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): elixir/diagnostics/native/spool/src/store.rs:44-51 | nix/domains/system/otel-guest/receiver/src/durable_slo.rs:598-611 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/store.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7bce2854050d6fdc24d329e422b5593ad7ce1d3b406041627ca0f03fec1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/transfer/key.ex:161-171 | lilly/lib/lilly/vm/checkpoint_storage.ex:272-283 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee75d879024e986ac20a1bfc1e268d5896d4e0638d53f72a995597795dd360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lyra/src/bin/overalls-agentd-windows.rs:81-89 | lyra/src/bin/overalls-native-agentd.rs:61-69 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-agentd-windows.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8960a5ba2f57f7163d0f87291bdb69b1325946a1acba84c9d03305fd9a9b3513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lyra/src/bin/overalls-ssh-sync-windows.rs:145-155 | lyra/src/http.rs:277-287 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-sync-windows.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115e01191870da57aec329e6f3fa1cc33ab168bcaefec18021ebe68b7067521"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/ingress/acme/request.ex:142-149 | marshall/lib/marshall/operations/runtime_config.ex:362-365 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/request.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea652784f260e26882d376f0283eb2836ae7c394ff8d6e20fd6f13daff6ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): protocol/lib/overalls_protocol/execution.ex:141-147 | protocol/lib/overalls_protocol/execution.ex:155-162 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/execution.ex"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b34874f4831627f77c30362f9bf19530de83ce16bce45a4e6076fe1353046"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): nix/domains/artifacts/guest/inception/observations.py:89-95 | nix/domains/artifacts/guest/inception/publication.py:93-99 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/observations.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e325d3945ddc5c5f64c8458e51a8bc53ca4c8219861eaa311d60ccdc19ace23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/terminal/stream.ex:144-154 | protocol/lib/overalls_protocol/control/client.ex:272-282 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b3729bc4c6d2960ded0ec80b06741c2c73cdbe60be0c5757d9140c8982d9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lyra/src/bin/overalls-host-certificate-windows.rs:50-57 | lyra/src/bin/overalls-ssh-sync-windows.rs:68-75 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c177578b90128106c05095f416e7d7979b64b9a622a1a9509ea6a77066674e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lyra/src/sys/socket.rs:251-256 | lyra/src/sys/socket.rs:265-280 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/socket.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726afc5e93e2f9498a44a41e63258e5c3e322a301846c54504d5ce675f2e256"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): marshall/lib/marshall_web/live/integrations_live.ex:115-127 | marshall/lib/marshall_web/live/integrations_live.ex:148-160 \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":"marshall/lib/marshall_web/live/integrations_live.ex"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3058d472783d0aea70e3508b1de1d06516508f875cffbd9c0cf55ff124e7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): mila/native/linux/src/journey_checks.rs:210-219 | mila/native/linux/src/journey_checks.rs:303-314 | mila/native/linux/src/journey_checks.rs:323-337 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/journey_checks.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9d7788730c9fdfdb3448e6c91d6b1d23b0dacca23338afee93b7ce62c02516"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): protocol/lib/overalls_protocol/relocation_cleanup.ex:34-47 | protocol/lib/overalls_protocol/relocation_readiness.ex:37-49 | protocol/lib/overalls_protocol/relocation_readiness.ex:58-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01118f048faee40e7669b62c6559b30665a02b7bb6c5a3f113822f6d4f6c75d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:539-548 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:550-559 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5efbbc510769c8098ecd4770f4af5d71fb606cc1c1fbfe7de6fb3e7fdb847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/artifacts/publisher.ex:170-177 | marshall/lib/marshall/artifacts/publisher.ex:181-185 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/artifacts/publisher.ex"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb494f6e064f0e6e670c3b1d5616bba84622d8ec4c88bdca72abfe9c67eaba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/rust/mila-ffi/src/android/terminal.rs:213-229 | mila/rust/mila-ffi/src/android/watch.rs:10-32 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f949d874ea82e12531548c6a3cc215f6e0478fe4877ac0f5c916796321749fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): mila/rust/mila-ffi/src/validate/push.rs:140-152 | mila/rust/mila-ffi/src/validate/trust.rs:18-30 \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":"mila/rust/mila-ffi/src/validate/push.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"915c1ba5a287a45f9a1d4207d56c97b7fd370096eea96e7b62b86b05cfa36560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): antithesis/workload/satellite/origin.py:88-94 | antithesis/workload/satellite/origin.py:97-103 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/origin.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac42a257ce78cc04a16c2b66af6c0ee3784772c2d602781d005ab3b541fdd2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nix/verification/hegel/python/hegel/generators.py:149-160 | nix/verification/hegel/python/hegel/generators.py:284-291 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/verification/hegel/python/hegel/generators.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e916c58a4ecc504d18ebfe591a0c7436df48d6daacee7caf1a16fe7f7107dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): mila/windows-dotnet/Interop/WindowsNotifications.cs:36-41 | mila/windows-dotnet/Interop/WindowsNotifications.cs:43-48 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WindowsNotifications.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8ee75351a83b23b3cd575cc0fa646f096e23fde6682ece695542b92b657299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lyra/src/workspace_receiver.rs:618-626 | lyra/src/workspace_receiver.rs:656-663 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/workspace_receiver.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0486bacd6ad4f701af1e3077849c716b18bfae16efc84a35d7220efa04e5d972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): marshall/lib/marshall/ingress/acme/propagation.ex:151-157 | protocol/lib/overalls_protocol/fleet_certificate.ex:97-100 | protocol/lib/overalls_protocol/inception_name.ex:132-135 | protocol/lib/overalls_protocol/inception_public.ex:60-62 | protocol/lib/overalls_protocol/transfer_ssh.ex:52-56 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/propagation.ex"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6de6504e9a3175d0ee45d2800d2169b2fa63eacf4de9a866af5ebb6c7a01013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): audi/lib/audi/control/link.ex:16-28 | lilly/lib/lilly/control/link.ex:15-28 | peach/lib/peach/control.ex:33-44 | porsche/lib/porsche/control/link.ex:16-28 | ziggy/lib/ziggy/control/link.ex:16-28 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/link.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dc87fe0921652b1aaabf22cc580e80ad12c1f895fa00f1b63fde1c7abff324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lilly/lib/lilly/transfer/checkpoint_transfer.ex:422-431 | lilly/lib/lilly/transfer/importer.ex:107-120 | lilly/lib/lilly/transfer/receiver.ex:215-228 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"387246bee39a3f2ff15146ba5ebe62f59709fbc51da83d34c9e6efd9d6142071"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lilly/lib/lilly/transfer/clone_copy_journal.ex:44-49 | lilly/lib/lilly/transfer/import_journal.ex:54-62 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee1b9ccce6e6dfe8bd78cf2e55bdec903dfced17cd5d0f04ce02e73f3ad88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lyra/src/sys/windows/net_api.rs:130-149 | lyra/src/sys/windows/net_api.rs:182-190 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/net_api.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a3adf3e8b624def77e6388d40e1d6d507a210e025769e89f2c6ab4168379d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): marshall/lib/marshall/accounts/security.ex:447-455 | marshall/lib/marshall/compute/cloning.ex:127-135 | marshall/lib/marshall/threads/controls.ex:173-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/security.ex"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6888eb00f65c2ab9a1bb7c58e41a93cba79e3cc5b15bead6bf523729d0622bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): marshall/lib/marshall/enrico/worker.ex:139-153 | marshall/lib/marshall/enrico/worker.ex:157-168 \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":"marshall/lib/marshall/enrico/worker.ex"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6431b31514a76e0a82fe382147bd972336ff5aad5b41f0b31d5d64b03b63aec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mila/rust/mila-runtime/src/push.rs:144-158 | mila/rust/mila-runtime/src/push.rs:318-335 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-runtime/src/push.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"956f7ed1ed102ba7593b002c5753144de41004165fb2d0812ea15a63a0b3db7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): nix/domains/system/otel-guest/browser_journey.py:684-694 | scripts/galileo_browser.py:139-148 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/browser_journey.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3f80ba45e69aa0adbf77c5c57e04624b89a5acd0b83da1e7108c22cc0cc5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): brady/lib/brady/destination.ex:119-123 | lilly/lib/lilly/lifecycle/backup_history.ex:107-111 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/destination.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc66927c06a1027268c780906d45e70cc62a11ca4d69259449e820f84d64ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lilly/lib/lilly/host/image_template.ex:503-512 | lilly/lib/lilly/transfer/import_cleanup.ex:224-235 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b207ae102e679164538eb2856e97b3bb6e1a1213502d2b56a2b0ab3114e261b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lyra/src/bin/overalls-trustd.rs:440-445 | lyra/src/guest/trust.rs:142-147 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3198a9d3c40915757b109cf1a4f0ec8e8f8e20990e45e42bf7c9eb4e41782a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/agents/bootstrap.ex:249-257 | marshall/lib/marshall/agents/maintenance.ex:198-210 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/bootstrap.ex"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64aa376fd0a42b59719f36eebf158f54fda5727a395bf7110f45b36445fe7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): marshall/lib/marshall/inference/control_requests.ex:94-100 | marshall/lib/marshall/inference/control_requests.ex:102-108 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/inference/control_requests.ex"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"823c3915a86518933addd04e8afbab8e922312c84e8bc3fc4fdde42050813ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): antithesis/operator/compute.ex:268-274 | antithesis/operator/compute.ex:307-318 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/compute.ex"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9e32569d2aa205847321f2ab7c41fcf1e74978fb8ab3d3751bac4608c19821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): audi/lib/audi/private/dns.ex:74-79 | audi/lib/audi/private/dns.ex:83-88 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/private/dns.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a22c2708bff7292dd3a5ce3e903f8a21b27a446a784636a21e2c2869ba7877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lilly/lib/lilly/vm/driver.ex:1411-1422 | lilly/lib/lilly/vm/driver.ex:1570-1581 \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":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f7b53897e7561ab79a8a3e94019c0e66079c242b09a0d4a569a76ccacc80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lilly/lib/lilly/vm/kernel_attestation.ex:63-74 | lilly/lib/lilly/vm/readiness.ex:53-64 \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":"lilly/lib/lilly/vm/kernel_attestation.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdce7f5806be74ae7541fc391c1111038563d61fcfcc4d77d37e64174d9421cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): marshall/lib/marshall/agents/thread_delivery.ex:126-147 | marshall/lib/marshall/agents/turn_coordinator.ex:13-38 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/thread_delivery.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c48a603629b5b002c13f0e32e4aa277d5788e8b87de74904610faccee682372"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall_web/ingress_known_hosts.ex:64-66 | protocol/lib/overalls_protocol/ssh_host_certificate.ex:159-160 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall_web/ingress_known_hosts.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4497e978c48b3067ce20a766e5421317a13ba090ab5d84f39abb64c3baa0f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall_web/live/account_live.ex:446-454 | marshall/lib/marshall_web/live/integrations_live.ex:176-189 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bacb044ad0dc5d18b06b9a66bdbd943fb36b46091faa10be619a99e238589ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mila/native/linux/src/route.rs:379-388 | nix/domains/system/otel-guest/receiver/src/binding.rs:15-25 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"363db1b13a77bc1b95e48eed719b55177c5a07c19933fe278ad3de794a842635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): protocol/lib/overalls_protocol/editor_login.ex:60-63 | protocol/lib/overalls_protocol/web_login.ex:69-72 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_login.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21a7ca091f7b7aa279f74097bb4a5df020d093b98300f0132e91bdf2f203011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): antithesis/operator/integrations.ex:97-101 | antithesis/operator/integrations.ex:109-115 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/integrations.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9214dfafb11e2d1cd55c6621d8f7fa27ee5951a5196176b243c90d3d67c7d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): audi/lib/audi/http/headers.ex:172-178 | audi/lib/audi/inception/client_hello.ex:94-98 | marshall/lib/marshall/ingress/publications.ex:308-313 | protocol/lib/overalls_protocol/editor_connect.ex:116-119 | protocol/lib/overalls_protocol/inception_parent.ex:31-36 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/headers.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4096f754dfcd5af51e729d6dedf96d032a2a4a1fef1b0cbdba299fd7a3aa0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lilly/lib/lilly/vm/driver.ex:88-92 | lilly/lib/lilly/vm/driver.ex:96-101 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9dc391020b2363fd3ec747d80eb4d36aa1ca6391d1c0b1e2fe570fd90941bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): marshall/lib/marshall/compute/relocation_probes.ex:277-287 | marshall/lib/marshall/compute/relocation_sources.ex:259-269 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_probes.ex"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"523716c0d4b8e05e5bfbb9c58cd214b4ae4d0aa0b97a6ff9837a62e33e74675a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex:14-22 | marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex:28-38 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"91df36b64fee3aec05b23a267bf8c25a13da16170236a4d9c6996ebf45650155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): protocol/lib/overalls_protocol/clone_control.ex:84-87 | protocol/lib/overalls_protocol/relocation_cleanup.ex:68-71 | protocol/lib/overalls_protocol/relocation_readiness.ex:71-74 | protocol/lib/overalls_protocol/relocation_receive.ex:35-41 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/clone_control.ex"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e382be4c51602e2dd360665939e9fe3998c0792d402b4e691d4496753a3173d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:295-297 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:299-301 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a7d97346e7660e9113634d6789165705cf6505982e5babad26dbd4a610cfb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nix/domains/system/fleet-addresses.py:125-132 | nix/domains/system/runtime-firewall.py:152-161 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/fleet-addresses.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7590a0b1093b2c2c3b7dc8a1bf78b699d1cb0f88789a793348507ea9bbef3fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lilly/native/hostd/src/transfer.rs:337-345 | lilly/native/hostd/src/transfer.rs:405-412 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0b5d22ed5515b472aed7e0854d2b1710a8267d1cabd9a2c77c80ae526d092d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mila/native/linux/src/route.rs:390-396 | mila/rust/mila-model/src/route.rs:274-280 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3869e7a9382b22ac276937f0e30ecf93c60effdc5892d83fe6c5b1e886b273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:56-59 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:75-78 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:74-77 | protocol/lib/overalls_protocol/relocation_keys.ex:83-86 | protocol/lib/overalls_protocol/relocation_receive.ex:65-68 | protocol/lib/overalls_protocol/relocation_revocation.ex:74-77 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:77-80 | protocol/lib/overalls_protocol/relocation_source.ex:89-92 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_destination_cleanup.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780195ed6fd44a8f226e88b30d553e694bd459544bfc2d0fe38f9d5d9df7305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lilly/lib/lilly/host/inventory.ex:115-123 | marshall/lib/marshall_web/live/git_live.ex:108-115 | marshall/lib/marshall_web/live/git_live.ex:119-126 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/inventory.ex"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c728283cd1c70bf728d65fe417673088b84696add8c7287f233e8dd7e8202f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lilly/lib/lilly/vm/executor.ex:594-601 | lilly/lib/lilly/vm/executor.ex:605-621 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb45627a72c7786746d4575cbcaf0bd2c4c67bb66a92a16a4eff0810cc419c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lyra/src/bin/overalls-ssh-authorize.rs:435-442 | lyra/src/private_http.rs:16-23 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"897c2f606f69d3353769a75673c7dd1730159866cdec70a0852c52c22d6b6ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/accounts/scim_retirement.ex:312-316 | marshall/lib/marshall/compute/clone_coordinator.ex:253-260 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/scim_retirement.ex"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d59db75a81cbdc3cd1398205a7cc60fcf6be09abf9816d615247129c4ee470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mila/native/linux/src/session/commands.rs:381-399 | mila/native/linux/src/session/commands.rs:403-419 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b49f7dc61babd16cf6ed4013db6740ab6c01349d7f3a246b7abb6d0ad860978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): protocol/lib/overalls_protocol/execution.ex:197-203 | protocol/lib/overalls_protocol/execution.ex:285-290 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/execution.ex"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"764803cc5001c2dcdef38d3a7aef23825f81a8e257f8073c105a0142a489ec62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): protocol/lib/overalls_protocol/view.ex:158-166 | protocol/lib/overalls_protocol/view.ex:170-178 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/view.ex"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e6e105ba5c8c508ab239c021f79ea06f12c6a3c664fa77637946f919ecfcc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): antithesis/workload/guest_lifecycle/witness.py:221-227 | antithesis/workload/guest_lifecycle/witness.py:230-243 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/guest_lifecycle/witness.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa39c327523f76841a9fdd3a653ab83173fc280e1ef11ec8d28bbdeebc97bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lilly/lib/lilly/host/zfs_dataset.ex:1363-1365 | lilly/lib/lilly/host/image_template.ex:604-606 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"71258d385cc48a323766cede664bc496ffb927d5f26a7e04ebbc41c3d3edc67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): antithesis/emulation/guest/runner.py:209-218 | antithesis/emulation/storage/origin.py:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fed5daf325be0dbffdb6524bbea9ff733db497725de94220c1dfafc349475c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): antithesis/emulation/guest/runner.py:620-630 | antithesis/emulation/guest/server.py:1114-1124 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd756f265a92be9e77a14091b87d5e2b6dbaccdf951b4907eab5dd0b40ba14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:449-455 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:469-475 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040d8e2c634444fe06e2324d0c03445e5113f3ea8afa08b11e79b75d25b256d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nix/domains/system/backups/schema.py:61-68 | scripts/vendor_localization_fonts.py:34-41 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/backups/schema.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b8b2e299066f1419449fcb0d56acbfcf99d41e9d69319a030db7ccb77a9c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lilly/lib/lilly/transfer/ssh.ex:176-181 | lilly/lib/lilly/transfer/ssh.ex:191-194 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/ssh.ex"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9963bdcb6ed82e83427c8beec2f56c585405cb75bed73e03be908b0502e9e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/vm/unit.ex:130-140 | lilly/lib/lilly/vm/unit.ex:144-155 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/unit.ex"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3165e560b534ff54cb6323acafbae82a4041fecbdfc6ab915df56d175c489a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): marshall/lib/marshall_web/live/admin/git_live.ex:14-26 | marshall/lib/marshall_web/live/admin/git_live.ex:46-54 | marshall/lib/marshall_web/live/admin/users_live.ex:94-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/git_live.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf0d30eaa5c1d1f8b601968fb29da12f5453a3cb2dc4878dc7f2afaa89cc844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mila/native/linux/src/journey_checks.rs:110-117 | mila/native/linux/src/journey_checks.rs:129-136 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/journey_checks.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dd09c0f768a00eda4e5f3b80ee82087d2fe2c97c2bcc450385e8280dadb245"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mila/windows-dotnet/Interop/RustNative.cs:833-839 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:67-73 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"883abc7ce8ecf749f0879fca2ad3ceffcefbda0ef8e5ebaef415e4936276cbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py:61-72 | nix/domains/artifacts/guest/native_git/extract_freebsd.py:70-81 \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":"nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f6c46d5330fd34c749f2c79fdd04e1c35f3c6b6c74b3b7cf063c0f29ec008f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): elixir/diagnostics/native/spool/src/main.rs:44-50 | nix/domains/artifacts/terminald/src/session.rs:1116-1126 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1d9d5ec63878441ed11febf94b20ffe291ce6ec9e0c59b588b5705009e20d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lilly/lib/lilly/host/zfs.ex:1329-1332 | lilly/lib/lilly/host/zfs_dataset.ex:1739-1742 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d0b6de724de51ae724e71bd46c1c1b669fb34f013252a5a179822082412c16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lilly/lib/lilly/terminal/vsock.ex:154-161 | lilly/lib/lilly/terminal/vsock.ex:234-241 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/vsock.ex"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80562f7ac8daa366892c5daa45fb0de452d89618e5dfbb8c26e967fbd42ee33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lilly/lib/lilly/vm/kernel_attestation.ex:30-32 | lilly/lib/lilly/vm/readiness.ex:28-31 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/kernel_attestation.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d274c91a875e0a9da247350369f99cbe904e1a108a23a02301a2e6cb59948da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/compute/ledger.ex:190-194 | marshall/lib/marshall/threads/sharing.ex:165-175 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/ledger.ex"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e75e5042a02dff86f21448c5038cbbda7fbb1d801e89bdcbd88a4e4ecda8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:58-71 | marshall/lib/marshall_web/live/machine_provisioning_live.ex:29-34 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"607873af712a70374cc1a598d240f68d06823e63bcdab45dfddcc4d8bb5b87e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): mila/native/linux/src/adapter.rs:659-670 | mila/native/linux/src/session/mod.rs:123-133 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/adapter.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ffdc4aaf2c03610677f65a49dabe56549509e47aa357bead45a0dad3e8e701"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:920-922 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:371-373 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6430e689b3d3ad5b21d39160f9bd17ab10f5a7fa7a444942b36069c54c2786a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): nix/domains/artifacts/guest/inception/git_identity.py:125-134 | nix/domains/artifacts/guest/inception/private_pki.py:82-88 | nix/domains/artifacts/guest/inception/runtime.py:30-35 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/git_identity.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6284611de82a89fbdf98271f25cbafefdaf6aedb27698ad4718fbd139754287"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/host/zfs_dataset.ex:1632-1638 | lilly/lib/lilly/vm/disk.ex:512-518 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4cb20b17b856db7329d61d25fadbb795d578ecc6be3ec1791690758a10ff47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/compute/relocation_receives.ex:253-260 | marshall/lib/marshall/compute/relocation_sources.ex:229-236 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b2a3574fdbe70689341a35562953e8bae4bd957ae8a3fe84248e88825a8cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nix/domains/artifacts/terminald/src/session.rs:1227-1235 | nix/domains/artifacts/terminald/src/session.rs:1260-1269 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66bc5ca83898ff38b6a8273399ef3aea9e8975b3688838b3bdd44705e1f81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nix/domains/artifacts/vscode-web-broker/src/validate.rs:45-53 | mila/rust/mila-transport/src/cert.rs:60-67 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/validate.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f43ca8cb0cf5747298ffdf222f0fb3e52acaae9dd25b8829fe2934fa29b16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): protocol/lib/overalls_protocol/relocation_import.ex:22-25 | protocol/lib/overalls_protocol/execution.ex:190-193 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_import.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1d5c832d425fefd7d8cb660d87b6c8fde024d871956bf43942a93d97ae7b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:215-219 | mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift:227-232 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaTerminal.swift"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ce55f6c501b37303480fc7f0ff8f2567315c78393e3431bf006a1593161486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lilly/lib/lilly/transfer/import_journal.ex:37-42 | lilly/lib/lilly/transfer/clone_copy_journal.ex:107-111 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb1c272ca2d48e65f07e20d029b1ec5e1617df7aa5ef3e2d9fe6d7fe1c61977"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/vm/workload_bundle.ex:147-158 | lilly/lib/lilly/vm/workload_bundle.ex:184-194 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/workload_bundle.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4748e7a7476ca15c8a5e4d1415763ceda04f83ed390db2db999c0a1c8b28a880"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): marshall/lib/marshall_web/ingress_api.ex:110-113 | marshall/lib/marshall_web/provisioner_api.ex:53-56 | marshall/lib/marshall_web/ssh_api.ex:82-85 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/ingress_api.ex"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe41d673038ea0209e218012ce90d8cbbc27dc83e4e3c3dc9d1192b00eecabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): protocol/lib/overalls_protocol/relocation_receive.ex:49-52 | protocol/lib/overalls_protocol/relocation_source.ex:64-67 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_receive.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8d5c7fbc783c4fec049168f6bdeca9cc202bcaf9b1f357af58e5f355a34b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lyra/src/agent/maintenance.rs:243-255 | lyra/src/platform/mod.rs:84-95 \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":"lyra/src/agent/maintenance.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"02078a6fdf40566127d885285874822ef37f224d3e677f71736a42933b3bfc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lyra/src/platform/mod.rs:99-110 | lyra/src/update.rs:133-144 \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":"lyra/src/platform/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f178b4b9225aee67f94d6d4b91fac189710eb0824e1da520a551ec93d2aa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/artifacts/library.ex:51-55 | marshall/lib/marshall/threads.ex:235-239 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/artifacts/library.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"34790001556af382b0d8572e7258056b30f2b750ef4db0464ce3c761432dc801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): marshall/lib/marshall/compute/clone_dispatch.ex:10-18 | marshall/lib/marshall/compute/relocation_advance.ex:9-14 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_dispatch.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b0160298b3c82416ef91c83946b4962f7ac4491b0f8b7b6e6e07da1f18db42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): protocol/lib/overalls_protocol/github_tools.ex:113-120 | scripts/localization_catalog_migration.ex:470-475 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/github_tools.ex"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8be71720a33b4921023044a99e203b1c88e16c625a3b50fe7b766b926ce51fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:43-46 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:62-65 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:61-64 | protocol/lib/overalls_protocol/relocation_keys.ex:70-73 | protocol/lib/overalls_protocol/relocation_revocation.ex:61-64 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:64-67 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_destination_cleanup.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3106dc6296a0a68fba055bcf436871b8211ca4c25a3424dfe886645b90dab960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lilly/native/export-channel/src/posix.rs:2-14 | nix/domains/system/otel-guest/receiver/src/main.rs:229-238 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:200-213 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/export-channel/src/posix.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf1c051b2e014df794bdc93a33f00f0bf0bcdc7a72a16e4139c73a3b7663de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/agents/context.ex:84-88 | marshall/lib/marshall/compute/evacuation_views.ex:459-463 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"293b796d5f66d4f013743c2f5a25bac52d8c1310d59d47e0ac3b78a52dff9dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/compute/relocation_probes.ex:293-297 | marshall/lib/marshall/compute/relocation_sources.ex:281-285 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_probes.ex"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f95ce4e17df5d9dfd7d840ec4aa8252ff047831429d4e4e391945ad6777174b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): marshall/lib/marshall/threads.ex:265-278 | marshall/lib/marshall/threads/generation.ex:101-111 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f6e04ccae5ac12b15e8b98816843b0245dc11e40702c8892b8b8d58b0a0f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mila/native/linux/src/session/pty.rs:162-169 | mila/native/linux/src/session/connection.rs:99-108 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/pty.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0dd0cc3fcf836fe8e375a037898adbd473c158c9e198d39c00c8769640cdc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): protocol/lib/overalls_protocol/terminal.ex:384-395 | protocol/lib/overalls_protocol/terminal.ex:565-575 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/terminal.ex"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9317e86c38b71dd9c3ece46812a088a104654bf6348104cd4aba5f6e34bcbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): nix/domains/system/fleet-addresses.py:37-49 | nix/domains/system/runtime-firewall.py:48-63 \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":"nix/domains/system/fleet-addresses.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cf9ca549b95ea06722beb8affb1fe664fc5885982b51033d7718c8dd429856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex:343-353 | lilly/lib/lilly/vm/jail.ex:173-186 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e62719bb2a1ee0599905f0f16c00e2f4e317e2ab57cadaf4fbbcf625a096ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): audi/lib/audi/ssh/listener.ex:127-135 | porsche/lib/porsche/listener.ex:141-149 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/listener.ex"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2739b6c23300726341ddda4359466c2f24c678acbb7b8b1e6bc1be985ab88c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): marshall/lib/marshall/agents/context_policy.ex:145-146 | marshall/lib/marshall/agents/model_protocol.ex:705-708 | protocol/lib/overalls_protocol/inference.ex:59-60 | ziggy/lib/ziggy/route.ex:47-48 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context_policy.ex"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8beb7e34e19852ea084e133a1511f2c523036e2bee1e45f137f06f82aa4fd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/compute/evacuations.ex:494-501 | marshall/lib/marshall/agents/skills.ex:653-657 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/evacuations.ex"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fe79db89d01a0a7ec969bd87b82125876b3f66a721df6265b8507800c465e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): nix/domains/artifacts/terminald/src/sys/windows.rs:113-129 | nix/domains/artifacts/terminald/src/sys/conpty.rs:169-182 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/sys/windows.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dce72cd244726dde94459e72195a343893da6dfce5af3678a848392472b29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lilly/lib/lilly/vm/driver.ex:1397-1407 | lilly/lib/lilly/vm/workspace_source.ex:255-264 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fe88d9fbba1b52452013b3427338762a566ff2898057ac4ba47246f373d3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lyra/src/sys/windows/trust.rs:19-36 | lyra/src/sys/windows/services.rs:29-37 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/trust.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97b154e23999c1fd7ef4acb9810b799a57def3f5ceaafcc589a6597b57d0e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): marshall/lib/marshall/accounts/account_lifecycle.ex:200-207 | marshall/lib/marshall/accounts/guest_accounts.ex:56-62 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/account_lifecycle.ex"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88a7d232067a3760972932adfb4408497b5b25d046302a7f0e2cf1e97fa4321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): marshall/lib/marshall_web/live/admin/workloads_live.ex:87-97 | marshall/lib/marshall_web/live/admin/operations_live.ex:23-33 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/workloads_live.ex"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba423371e35387bb40d4dd48f80d1f2e8a18e44111e1f3b88659360d67d71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex:75-78 | audi/lib/audi/config.ex:397-400 | porsche/lib/porsche/config.ex:111-114 | susan/lib/susan/credentials.ex:59-62 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_rpc.ex"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d04ec1016baaf870585e7b3ccbbefe547c4835d338a5e36db063ef84ce65630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): brady/lib/brady/metrics.ex:241-247 | porsche/lib/porsche/observability.ex:301-309 | ziggy/lib/ziggy/spool.ex:436-444 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/metrics.ex"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c8a9d09059e3097d0f8147d53a268c02c26345c22b08635d3e301cc824c0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): elixir/request_accounting/lib/overalls/request_accounting/config.ex:89-92 | elixir/request_accounting/lib/overalls/request_accounting/recorder_rpc.ex:80-83 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/request_accounting/lib/overalls/request_accounting/config.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00d6c046a600b2d89ad6653fe129afefdf0a59f20745726b6f7e55e28969ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lilly/lib/lilly/inception/propagation.ex:147-151 | marshall/lib/marshall/ingress/acme/propagation.ex:145-148 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d13e3ffcbccd9c0974791a04d10c02bf0894457a85dd422febb660449485835"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lilly/lib/lilly/network.ex:328-331 | lilly/lib/lilly/vm/disk.ex:284-287 | lilly/lib/lilly/vm/driver.ex:2361-2364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network.ex"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b16554f84803dac6a76972b0911704e152016ae36184e816ec44cd4c474853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): marshall/lib/marshall/compute/command_snapshot.ex:176-182 | marshall/lib/marshall/compute/git_identity.ex:33-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/command_snapshot.ex"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b9fddf80376e5120952711a9e647f96321c620b83b00dd60e89c110b039b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): protocol/lib/overalls_protocol/editor_login.ex:30-32 | protocol/lib/overalls_protocol/web_login.ex:27-29 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_login.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a3a7187f164aed9b2d23dcb750b6ddc380cf73f0bd732bef825fa23c6ed61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): .github/scripts/mila-tailnet-join.py:65-70 | .github/scripts/mila-tailnet-peers.py:121-125 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/mila-tailnet-join.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bee96c42187e93e7e10bdb2a83d32bd4bd732da7cab0189072b1a6c1a685b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:910-910 | mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:917-919 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:75-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd94c67c3e52603db9cf79ef76d41591b2c136cee214131f36d76059d355c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): mila/native/apple/Sources/MilaNativeUI/MilaSnapshots.swift:19-22 | mila/native/apple/Sources/MilaNativeUI/MilaSoftwareDeviceKeyStore.swift:16-19 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaSnapshots.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a454901d9a9342a0348b7dacbaca13b90f5448ffc1b89f1348e29bd56f4ce8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): antithesis/emulation/guest/runner.py:229-233 | nix/domains/artifacts/guest/windows/stage-editor.py:35-40 | tools/buck2_no_nix.py:89-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8346bbe385da2d776c696f175ade7e299d89e093276afa16d31a7445b6d6dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): nix/domains/artifacts/guest/inception/control_tls.py:129-135 | nix/domains/artifacts/host/enrollment.py:90-95 | nix/domains/system/acme/publish.py:106-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/control_tls.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"addbdacd99475b360ae93ed988e3cef04d07d2145621139a9f138bfd699f553d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): audi/lib/audi/http/proxy.ex:248-250 | audi/lib/audi/private/front.ex:311-313 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5489cd7c49a6ecf917eacbcd3fa9876a4e8bebe32aea3f68d550e8d9a7378715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lilly/lib/lilly/vm/disk.ex:522-526 | lilly/lib/lilly/vm/driver.ex:2376-2380 | lilly/lib/lilly/vm/workload_bundle.ex:248-252 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/disk.ex"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"10445efb1ada4f4cbcfacf21cc56d951118268e0c2c2b5bb20f7ad6581fd3d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): marshall/lib/marshall/access/authorization.ex:21-23 | marshall/lib/marshall/threads/authorization.ex:16-18 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/authorization.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"94be599be9b46b17abe7add8a1623b48543046cf468b8f6cf8e44983a9f9f6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/terminal/peer_socket.ex:163-170 | marshall/lib/marshall/terminal/remote.ex:188-195 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/peer_socket.ex"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3bdcb29399a1679dad60de4c211b051aecf924854cb08c4a21c288e7941578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/fleet_certificate.ex:89-92 | protocol/lib/overalls_protocol/ingress_route.ex:82-83 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/fleet_certificate.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d457b4e0c3c73af723523ced152f1eb3969879f28d1945e4a09d6000b730bb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): antithesis/emulation/guest/server.py:876-884 | antithesis/emulation/recorder/bridge.py:104-110 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/server.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"57200ba8485aaaf2c237a226fa2b0093a06bb5f6361bb2e629336f23203e7f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 3\u002B corresponding lines): marshall/scripts/localization_browser/run.py:61-63 | nix/domains/artifacts/guest/omnios/check_assembly.py:79-81 | scripts/egress_acceptance.py:34-36 | scripts/galileo_acceptance.py:28-30 | scripts/porsche_acceptance.py:60-62 | scripts/provisioning_benchmark.py:236-239 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/run.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b77a0dc0876e366c6d99880d90dfa41af3448471bd2c6bc5e413e48fcf2ae1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex:117-119 | elixir/diagnostics/lib/overalls/diagnostics/metrics.ex:288-290 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"980c587a0b06391f535f2e64204d20b0e69a5807065d9de9592b3227589e0ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/lifecycle/image_template.ex:68-69 | marshall/lib/marshall/compute/enrollment_request.ex:102-103 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/lifecycle/image_template.ex"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d83c2167d9848f3b51132af14651d3a7867f3454e59b6d410be0830ecdf867f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lilly/lib/lilly/terminal/stream.ex:212-216 | protocol/lib/overalls_protocol/control/client.ex:177-181 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8070ef162cd39055d371e99e40e82c496c10852de0e5980d731dfbbcd1a5e280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lilly/lib/lilly/vm/kernel_attestation.ex:45-57 | protocol/lib/overalls_protocol/inception_exchange.ex:95-105 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/kernel_attestation.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"679769e8b570816660e150cbc68a827289e6c52c3019eff2d3862c90f0f291e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lyra/src/config.rs:135-142 | mila/native/linux/src/session/commands.rs:7-12 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/config.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"168737a7af8f46c4fe633df81ec70b65972b1ced560430557eaa5ecaa4d6effa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): marshall/lib/marshall/compute/clone_guard.ex:32-38 | marshall/lib/marshall/compute/resize.ex:106-109 | marshall/lib/marshall/threads/feed_append_job.ex:85-92 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_guard.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d389a9607f8d09cf7e4df0c5b880e7f0a5e189737bec64807630603785ed40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): protocol/lib/overalls_protocol/susan_poke.ex:198-201 | susan/lib/susan/poke/request.ex:106-109 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/susan_poke.ex"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf35968222e6f6fe186a153ad07c0c4633f791161a65d662c0d1fd004341e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): audi/lib/audi/http/browser.ex:95-98 | audi/lib/audi/http/editor_browser.ex:95-98 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"746adc8d3223c0ecd5b21169e3f639d5521a1e64c1804247df3c98d1f52a0d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): brady/lib/brady/cache/recovery.ex:86-87 | brady/lib/brady/metrics.ex:198-199 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"brady/lib/brady/cache/recovery.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44164b57a08ae4d9cbe6c6d0f36d5dd078e12542ca24f0177cdfd1107ec0642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lyra/src/sys/socket.rs:94-103 | nix/domains/artifacts/terminald/src/sys/pty.rs:73-81 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/socket.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2cb5334fbf6029a743eb4384aba425bae80df8d840947d74bcf631462bc1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/accounts/git_username.ex:27-28 | protocol/lib/overalls_protocol/git_identity.ex:36-37 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/accounts/git_username.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66721e4e688b287ac6dbe0602044d058a5f2016f16c93b2dfdad74bd8661dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/agents/bootstrap.ex:188-196 | marshall/lib/marshall/agents/maintenance.ex:174-182 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/bootstrap.ex"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c9c4a39ebf6c2a0372e9dff74412eeb41e1f90b5f4393e52994c1b499a7798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/ssh/guest_access.ex:203-210 | marshall/lib/marshall/accounts/security.ex:23-26 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/guest_access.ex"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"306835f80b69026482462325cf33896d7e052367cefd00a7396d86c1e9c3b93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): porsche/lib/porsche/ssh/onboarding.ex:75-87 | protocol/lib/overalls_protocol/ssh_onboarding.ex:66-75 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e9cdf662275cb30860f8d0d39ff98b1836a53747880e1cdb86109c3653ba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): antithesis/emulation/host/bootstrap.py:43-46 | antithesis/emulation/host/runner.py:87-90 | antithesis/emulation/storage/bootstrap.py:33-36 | antithesis/emulation/storage/control.py:63-66 | antithesis/emulation/storage/runner.py:104-107 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf14fba6334c98aaf1054594d93b45e36b27213b1d556b58bd89a38edfb286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 2\u002B corresponding lines): lilly/lib/lilly/control/runtime.ex:460-461 | lilly/lib/lilly/ingress/server.ex:110-111 | lilly/lib/lilly/network/attribution_server.ex:93-94 | lilly/lib/lilly/private/server.ex:93-94 | lilly/lib/lilly/vm/actor.ex:239-240 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa229e82292f7bbfd094db9d5c48ebe09ffff27ae4c9e9752daae44d56c8b4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): marshall/lib/marshall/agents/cli_access.ex:194-195 | protocol/lib/overalls_protocol/editor_name.ex:31-32 | protocol/lib/overalls_protocol/image_manifest.ex:671-672 | protocol/lib/overalls_protocol/kernel_attestation.ex:105-106 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/cli_access.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b3754b144f40441dc0ab3f72bd1802d11b3b9c350ab17f24654bb52d91b2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): marshall/lib/marshall/compute/advance_drain.ex:7-13 | marshall/lib/marshall/compute/advance_evacuation.ex:11-17 | marshall/lib/marshall/compute/lifecycle.ex:43-54 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/advance_drain.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"259e34b16bf047bedf2f76579a1e19f7eb01a92be80184ca791a856c1488b6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/ingress/environment_discovery.ex:10-11 | marshall/lib/marshall/ingress/environment_streams.ex:19-22 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/ingress/environment_discovery.ex"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4c8699183c616cc7b077170c6479bad48ef07f5ae8c98afa82eee3b2520fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/kernel_attestation.ex:100-101 | protocol/lib/overalls_protocol/readiness.ex:66-67 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/kernel_attestation.ex"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d373372fa29af376ea28d5dfbab99959fa4b40782890cbe3ad6098e68921d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/ssh_command.ex:589-590 | protocol/lib/overalls_protocol/susan_poke.ex:67-68 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/ssh_command.ex"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7f632315c649737855a903c8f3934a11aaf82fe6f74e6e11c21a9f41d0c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): antithesis/workload/admission/client.py:230-234 | antithesis/workload/guest_lifecycle/operation.py:266-273 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/admission/client.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3445ac31ad1413a05d630303a1ba591d08ccefe333fe95c15a5bbe4941e37ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): audi/lib/audi/dns/server.ex:138-142 | audi/lib/audi/relay/server.ex:99-102 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/server.ex"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e06e790f98dedcd0a9d266aa57aca8716b59e2d4065f1b3e0702ad37e77bd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): galileo/lib/galileo/config.ex:45-48 | peach/lib/peach/config.ex:58-61 | ziggy/lib/ziggy/config.ex:125-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/config.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e528efdf8de4f1418087f7875a04bbd66c7d5b47c65965083e4b6bbc7029f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): marshall/lib/marshall/accounts/prune_security.ex:7-21 | marshall/lib/marshall/terminal/reconciler.ex:244-269 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/prune_security.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08ac9edf2572d40282d7ed12ab4498c0c6a699fea16c034c7e4338059beaf16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): antithesis/emulation/host/runner.py:157-160 | antithesis/emulation/storage/runner.py:158-159 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"antithesis/emulation/host/runner.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"04740dad36234f6fa1367c361085bacc42e9d3f6aaef54aacbcc168e48aa3f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): antithesis/operator/fixture.ex:373-376 | antithesis/operator/integrations.ex:276-279 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/fixture.ex"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a338a3625f0edb085e0c627c5494a372073c6172d3dfebc5c291c5f47120d2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/http/proxy.ex:252-253 | audi/lib/audi/private/front.ex:315-317 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"889a88febf534fe03e59cf38c9752a9c5cf52a51c303fa8cd8c5fd53530977bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): audi/lib/audi/ssh/listener.ex:120-123 | porsche/lib/porsche/listener.ex:134-137 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/listener.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9ca68d283149ccfd4141539e668e100ca7c72e404e5406a8df8714582a9eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lyra/src/sys/windows/job.rs:25-32 | lyra/src/sys/windows/services.rs:19-26 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/job.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee5ad2ef736c55a07d1b9d7077b0351f0e1b06a9a17a075069f42202f72c2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): marshall/lib/marshall/galileo/credentials.ex:78-80 | marshall/lib/marshall/peach/credentials.ex:78-80 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd689ea83d3ff7ab6933a283e93bb68613299c55e20386e4048b83c5e5a59579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/config.ex:379-380 | porsche/lib/porsche/config.ex:93-94 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/config.ex"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af52b26ef60d598e786da5e294f5928064425bef1dbc07a135da4a2b0bf99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lyra/src/update.rs:317-323 | nix/domains/artifacts/terminald/src/log.rs:283-289 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/update.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"45026da0775003ce718477943690e286ac34d8dfa689a80f82af5a45ec3e6215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): marshall/lib/marshall/editor/authority.ex:507-510 | marshall/lib/marshall/ingress/execution.ex:206-209 | marshall/lib/marshall/ingress/relays.ex:282-287 | marshall/lib/marshall/ingress/routes.ex:182-185 | marshall/lib/marshall/ingress/sessions.ex:229-232 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3d6b6aeaf47525a195b7938590f6e9ecaff123c4446f37c9b4c0ca6f131f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): marshall/lib/marshall_web/live/admin/access_live.ex:12-13 | marshall/lib/marshall_web/live/admin/operations_live.ex:12-13 | marshall/lib/marshall_web/live/admin/workloads_live.ex:12-13 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/access_live.ex"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9799fda6dae92c22783caeb0660c127f7a89e539d6b4331c143dc0b97de613d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): protocol/lib/overalls_protocol/disk_transfer.ex:107-108 | protocol/lib/overalls_protocol/relocation.ex:204-205 | protocol/lib/overalls_protocol/terminal.ex:726-727 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/disk_transfer.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a878b0a1d2193533be85c384b8ef134902d99e354f7396bc00a44462898993ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/image_manifest.ex:468-469 | protocol/lib/overalls_protocol/native_admission.ex:91-92 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1827ad0e2f6ae09a086cbda8984e8723c06bac0229f1886840a546330b0be5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lilly/lib/lilly/host/backup_snapshot.ex:198-201 | lilly/lib/lilly/transfer/snapshot_ownership.ex:54-57 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"989b0ffa8dc3a45efec750455061995c4cb80e50dce887ebde1e0e0516627bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lilly/lib/lilly/vm/driver.ex:1390-1393 | lilly/lib/lilly/vm/workspace_source.ex:272-275 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbcdc483fb052db6473b5db65dd840d7769f156b929f2946ec1dc9bf9af3f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/compute/relocation_receives.ex:248-251 | marshall/lib/marshall/compute/relocation_sources.ex:224-227 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"716e7f7495dcff3e9a0b12c909158b57554c873726d34875258d6dc5b5201b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/operations/audi.ex:164-167 | protocol/lib/overalls_protocol/ingress_relay.ex:50-56 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/audi.ex"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8816bf19f439a57adb3da1962efa3456923987f69ddba8424dc8992336e41052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nix/domains/artifacts/underclass/slo.rs:524-532 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:483-491 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/underclass/slo.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"801e86759ef0abbe317d2be53d7324a94d30e776b1da58231ae26fecd7c13d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): nix/domains/artifacts/guest/windows/stage-winget.py:231-233 | nix/domains/artifacts/guest/windows/update-winget-pins.py:102-104 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/windows/stage-winget.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a891c85e55483f60819f1b847ba7e12cacc61a092de712ec10bc1a56611f8268"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/http/proxy.ex:266-267 | audi/lib/audi/private/front.ex:338-339 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e48603f9caa34848f05595bfc070d72da4262982916583dd82970006c010c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/native/hostd/src/policy.rs:86-92 | lilly/native/hostd/src/zfs_policy.rs:40-46 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf361fcd07b94e8649c2921d0d53c0c9722cfa6637ab72c79c59bd4d5c3c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): marshall/lib/marshall/accounts/scim_retirement.ex:302-304 | marshall/lib/marshall/scim/retirement_worker.ex:51-53 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/scim_retirement.ex"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b366a45f8bccb3dc24844c6398348f44ac4115c24d8ace776d7b2956fda848"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): marshall/lib/marshall/compute/clone_coordinator.ex:117-124 | marshall/lib/marshall/compute/clone_effects.ex:77-84 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_coordinator.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d3f573e4f54862297ce50ff6a43f52f2c99dc32fa27666104132a537e04a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/compute/relocation_receives.ex:89-92 | marshall/lib/marshall/compute/relocation_sources.ex:88-91 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3632951881faef18f6d0bb13fa3641634a17b769df987f756d6ac1e60b85b2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): marshall/lib/marshall/control/services/lilly.ex:43-45 | marshall/lib/marshall/control/services/peach.ex:13-14 | marshall/lib/marshall/control/services/ziggy.ex:34-36 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/lilly.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"606e27851d4f34febbab569cabbcf2efec27e9c8b0b69810a80e365d08d10527"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mila/rust/mila-ffi/src/session.rs:222-230 | mila/rust/mila-ffi/src/session/watch.rs:35-43 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"02031a2c169412d14b198e5bf98cbc3d35fbe51763b03e6699815e0691aeb84f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): protocol/lib/overalls_protocol/editor_stream.ex:15-19 | protocol/lib/overalls_protocol/nested_stream.ex:32-36 | protocol/lib/overalls_protocol/web_stream.ex:25-28 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf46b1e4d95a45d59cb830cbec0f916c16f3f9eb0d85e3a7dab5668aecd9261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/privacy.ex:62-63 | porsche/lib/porsche/privacy.ex:53-54 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/privacy.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a521544dda815dcb2804102c302817c79da825af2245de9e6e3b33fc8ee3eeaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/vm/credentials.ex:190-191 | protocol/lib/overalls_protocol/image_manifest.ex:666-667 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b228108cfc8b20cc8a8ad0e374753207e0c59676e0690af12d9c12339bea9fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): marshall/lib/marshall/compute/drains.ex:313-314 | marshall/lib/marshall/compute/evacuations.ex:437-438 | marshall/lib/marshall/compute/relocation_guard.ex:63-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/drains.ex"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"db01292b5c3ca763b70c3cb462977cb86f88e13e37f84297ec150c28e784cdc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): marshall/lib/marshall/control/services/galileo.ex:15-18 | marshall/lib/marshall/control/services/peach.ex:5-8 | marshall/lib/marshall/control/services/ziggy.ex:22-25 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/galileo.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3372e49442fab5de47e0a6d03ba60637515c39da4eb752c69900ab628856815e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): marshall/lib/marshall/operations/git_hub_config.ex:48-48 | susan/lib/susan/keys.ex:126-126 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"marshall/lib/marshall/operations/git_hub_config.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fbb14a7aed81e7018659e31b1ddc5f53d19c6735865e06360cc92796b64fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall_web/control_api.ex:67-70 | marshall/lib/marshall_web/terminal_gateway_api.ex:98-101 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/control_api.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"74afbd23158aaf5e01cf819b208969e7fb35d4f3a1cf71fec5e32cbc23d43525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall_web/ingress_api.ex:47-48 | marshall/lib/marshall_web/ssh_api.ex:37-38 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall_web/ingress_api.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3942c00be4fc603e2d825e18a0f8a3e81229863c24029246d0b52c212db67d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/execution.ex:426-427 | protocol/lib/overalls_protocol/ssh_command.ex:487-488 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/execution.ex"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afa48a3e9ecf7f75771187ce02761affc2a341e2c9e293ae8a70efaf7e373f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/github_tools.ex:123-124 | scripts/localization_catalog_migration.ex:478-479 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/github_tools.ex"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfd36a963b3e24d438ce0135858f5d8dba1af8244b820fc461413efbbda2d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): antithesis/workload/core/config.py:96-99 | antithesis/workload/core/profile_readiness.py:37-40 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/core/config.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d91136ebfdea0591c9e27ace685b2e4b241d533e106b05a6bd5e02e3d6b130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): audi/lib/audi/http/proxy.ex:270-273 | audi/lib/audi/private/front.ex:342-345 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d860e3bca11d8f9b1935df86a4493f34eded42be1fb741a89d164dfa26b72625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): audi/lib/audi/tls/fleet_certificate.ex:42-44 | lilly/lib/lilly/execution/watch.ex:40-42 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/tls/fleet_certificate.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ad702e8f096e77a4e41e1ca285197b187fae9e56589ba4b3c08f1f4d7b717e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:300-301 | lilly/lib/lilly/host/backup_snapshot.ex:220-220 | lilly/lib/lilly/lifecycle/image_template.ex:45-46 | lilly/lib/lilly/lifecycle/provisioning.ex:89-89 | lilly/lib/lilly/transfer/clone_copy_journal.ex:285-285 | lilly/lib/lilly/vm/workspace_source.ex:311-311 | marshall/lib/marshall/agents/skills.ex:771-771 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"047a8480424feba4f8021bd66ac162ea6cc1f4df198f039faf7ff2f1e8d57858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lilly/lib/lilly/clone/runtime.ex:99-102 | lilly/lib/lilly/transfer/key_runtime.ex:93-96 | lilly/lib/lilly/transfer/source_runtime.ex:117-120 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/clone/runtime.ex"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cd7d9863ebe26af12b85d56e9890abb44535601c28ecfcc5cb6b642af4e15a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): lilly/lib/lilly/network/flow_lookup.ex:31-33 | susan/lib/susan/config.ex:220-220 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"lilly/lib/lilly/network/flow_lookup.ex"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46cee3dbe58d11f622b8c246dcfd0307c5f6c90de0b7657106ab2f36c584462"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): lilly/lib/lilly/vm/credentials.ex:135-138 | lilly/lib/lilly/vm/inception_exchange.ex:110-113 | lilly/lib/lilly/vm/kernel_attestation.ex:112-115 | lilly/lib/lilly/vm/readiness.ex:95-98 | lilly/lib/lilly/vm/workspace_source.ex:284-287 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"de47d3f9019ef8a3877fb65b55b364f80c8d63cd9a2e800ee005239947c89392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lyra/src/bin/overalls-agentd-windows.rs:32-35 | lyra/src/bin/overalls-native-agentd.rs:22-25 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-agentd-windows.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"324d15a0939d9ef266e676abed0de6ad5d5a605e29a542f37a66e50079401aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): marshall/lib/marshall/agents/executor_rpc.ex:304-305 | nix/domains/artifacts/guest/native-promotion/verify.ex:312-312 | protocol/lib/overalls_protocol/github_tools.ex:19-19 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/executor_rpc.ex"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaccc0c81f542a41f2c5813bcfe1387fa35aab8a91387dfb51fc1610dc2316b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): marshall/lib/marshall/galileo/credentials.ex:107-110 | marshall/lib/marshall/inference/credentials.ex:178-181 | marshall/lib/marshall/peach/credentials.ex:107-110 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0779aa68e37f0a1fad83ebccc8d655ca901afcf673d501f3c68198c32b03c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): susan/lib/susan/provider/apns.ex:74-75 | susan/lib/susan/provider/fcm.ex:78-79 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"susan/lib/susan/provider/apns.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67d6ecfa066996908d582f91255d2a8bc963d07bba5bcbb2e41f153159a8674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): audi/lib/audi/dns/authority.ex:87-87 | audi/lib/audi/private/dns.ex:29-29 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"audi/lib/audi/dns/authority.ex"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa75556007ffcd09fd2dd0c26729332365d842ae6470ae2134004aed3ad2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lilly/lib/lilly/execution/liveness.ex:90-92 | protocol/lib/overalls_protocol/cadence.ex:44-46 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/execution/liveness.ex"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"831e9a1865d85d4c1be883516e85b4a43eb9042cd1b08de124dde8b908b7b5c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/transfer/destination_revocation.ex:45-46 | lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:126-127 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/transfer/destination_revocation.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"20515d7e67d868be13731cccc01c3c11a372df221fef0036fba6fcf9c5927d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lyra/src/bin/overalls-agentd-windows.rs:56-61 | lyra/src/bin/overalls-native-agentd.rs:48-52 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-agentd-windows.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf28e1c578a4d3bde06487837b5b9db7ffcd5f2fa0aaa0a6905858972081dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): marshall/lib/marshall/artifacts/paths.ex:94-94 | susan/lib/susan/http.ex:118-121 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"marshall/lib/marshall/artifacts/paths.ex"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a860055a61775236ded7f8db9bf3c7a55f550c54895536982da6a74f909c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): protocol/lib/overalls_protocol/execution.ex:465-468 | protocol/lib/overalls_protocol/relocation.ex:198-201 | protocol/lib/overalls_protocol/terminal.ex:682-685 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/execution.ex"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4fbca7e18e732ec4f160f98a2794edb5f20587defdc4e77dfe05043e1de371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): protocol/lib/overalls_protocol/relocation_cleanup.ex:96-98 | protocol/lib/overalls_protocol/relocation_readiness.ex:101-103 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc211c9fe665a3f13a8b50606b3527cae6735d22b07b4635b424f7def579a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): antithesis/sdk/lib/overalls_antithesis/sdk.ex:194-195 | marshall/lib/marshall/operations/runtime_config.ex:405-408 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"antithesis/sdk/lib/overalls_antithesis/sdk.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"652c99821b2bd24462f65758d0ee6c4fe1d1dfa978d1fd543ea427c2461f41c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): audi/lib/audi/authority/stream_guard.ex:85-86 | marshall/lib/marshall/terminal/peer_socket.ex:144-145 | marshall/lib/marshall/terminal/remote.ex:144-145 | ziggy/lib/ziggy/lease.ex:71-72 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/authority/stream_guard.ex"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9acfbff08d288b8a3d0b9b15c57467458b7bf89084192fc64ee77d7c309f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): audi/lib/audi/dns/replica.ex:120-123 | audi/lib/audi/http/editor_assets_publisher.ex:79-82 | audi/lib/audi/ssh/key_publisher.ex:77-80 | audi/lib/audi/status_server.ex:80-83 | audi/lib/audi/tls/fleet_worker.ex:101-104 | audi/lib/audi/tls/readiness.ex:116-119 | protocol/lib/overalls_protocol/control/client.ex:111-114 | susan/lib/susan/source_address.ex:61-64 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/replica.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"39298fbc67105c06b67ad1aebc1ff4b536ac2b17526fbae4cb579079b2d5eb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/dns/wire.ex:132-133 | brady/lib/brady/tls/hello.ex:85-86 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/dns/wire.ex"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"becdb11ed1d8c82ec87195ddf0bcceaf1a5116015885018c4c28244e60cdc731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): audi/lib/audi/privacy.ex:68-68 | porsche/lib/porsche/privacy.ex:59-59 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"audi/lib/audi/privacy.ex"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8c83e325b3d622becb9d1e1081342666ef3578fb4f77123572f78991413c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): elixir/diagnostics/native/spool/src/schema.rs:33-40 | nix/domains/system/otel-guest/receiver/src/sanitize.rs:58-65 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/schema.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a595ba30e330f04be15add54a85cd9e653f784d077f8a98527f04d924c6a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): lilly/lib/lilly/host/limits.ex:159-162 | lilly/lib/lilly/host/pool.ex:380-383 | lilly/lib/lilly/host/usage.ex:138-141 | marshall/lib/marshall_web/terminal_gateway_api.ex:119-122 | marshall/lib/marshall_web/terminal_socket.ex:54-57 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/limits.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3c1094b2a3f5c0100ead5cf21ffc2aa0627641a5e754eaef6c0f11b7f82df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): lilly/lib/lilly/transfer/snapshot_journal.ex:299-299 | protocol/lib/overalls_protocol/relocation_probe.ex:134-134 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"lilly/lib/lilly/transfer/snapshot_journal.ex"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1b85fdf5df191d92d641ea288eed0a1acf0c2a04e35fdb715c7d80780a65a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): marshall/lib/marshall/mailer/log_filter.ex:29-32 | marshall/lib/marshall/operations/privacy.ex:7-10 | marshall/lib/marshall_web/terminal_log_filter.ex:7-10 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/mailer/log_filter.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed7090e40040d03c3a9e430efe4a0c416851dec0a27e743e5a85dd4fc549b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): marshall/lib/marshall/terminal/sharing.ex:137-145 | marshall/lib/marshall/terminal/termination.ex:174-182 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/sharing.ex"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a37501c1663bd1fd47f95c45b89f6490712f1f9c0d89cc6679691370cc7324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): protocol/lib/overalls_protocol/checkpoint.ex:62-63 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:81-81 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:93-93 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:92-92 | protocol/lib/overalls_protocol/relocation_keys.ex:101-101 | protocol/lib/overalls_protocol/relocation_revocation.ex:92-92 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:95-95 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/checkpoint.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8f9ebcb5d95f78b6377080a9ea8b7a0c47ed357b7989d8bc60818108c9bbbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): audi/lib/audi/config.ex:382-383 | porsche/lib/porsche/config.ex:96-97 | susan/lib/susan/credentials.ex:78-79 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/config.ex"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d684fd941786c09f320e6743e3c5f5fe03407a9e0ca237ccac93fd288dd5b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): audi/lib/audi/ssh/proof.ex:84-87 | porsche/lib/porsche/ssh/proof.ex:87-90 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/proof.ex"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4958df4ef23adc065b057910c2db82e1beaf29eafcc2b89f086e021907406cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): galileo/lib/galileo/http.ex:314-315 | ziggy/lib/ziggy/http.ex:620-621 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"galileo/lib/galileo/http.ex"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5860771a79e51ae188e031f002e0550e2c055083facdbf5bd7bac073cc74bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/host/pool_queue.ex:34-35 | lilly/lib/lilly/host/template_steward.ex:19-20 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/host/pool_queue.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c18f0789d48f93caeb2c7ca8119fe44b33295302df00c0ca63a3a5c8f6613c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/access/sharing.ex:159-160 | marshall/lib/marshall/threads/sharing.ex:154-155 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b2408b22fa12ee65bb8153fa1d85c44bdf035e358938a9c19e8d178d0c2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): marshall/lib/marshall/editor/authority.ex:491-495 | marshall/lib/marshall/ingress/environment_streams.ex:130-132 | marshall/lib/marshall/ingress/sessions.ex:253-255 | marshall/lib/marshall/ingress/web_streams.ex:276-278 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6152fd5d9d370cc88598972c2ca91295c8389a569bfff864a01067f54cffb356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/galileo/integration/cedar.ex:33-36 | marshall/lib/marshall/threads/thread/cedar.ex:44-47 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/integration/cedar.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd267c56b23449fa1ef240474a9b84ccc8df7cb09027907dd38cbb3774d85d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/terminal/peer_socket.ex:151-152 | marshall/lib/marshall/terminal/remote.ex:147-148 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/terminal/peer_socket.ex"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd9d8d71f167d2df0f95b461586afb98390110ad0693c90700a7cbac03c2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall_web/live/machines_live.ex:441-442 | marshall/lib/marshall_web/live/threads_live.ex:541-542 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6cc6ad6a3d9402e8765e60500991e7e7fa841f1f5855a22c18e28fc69958da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): porsche/lib/porsche/connection.ex:205-206 | protocol/lib/overalls_protocol/inception_exchange.ex:112-113 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"porsche/lib/porsche/connection.ex"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c4d30a7581497b6a5a1f6666713da0c57e952574566ac611ea0d36809fb1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): protocol/lib/overalls_protocol/fleet_certificate.ex:20-21 | protocol/lib/overalls_protocol/ssh_management.ex:26-27 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"protocol/lib/overalls_protocol/fleet_certificate.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fce5ec3221e9b1e7b7ac32a47b792796417b84f0ebc5950fdd96aaeb17956a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): nix/domains/artifacts/host/cli.py:171-173 | nix/domains/system/secrets/prepare.py:261-263 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/host/cli.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e10e6d5520a3d7d51e0574c5206cd9e75f692533f02f5b80d3cf966701be3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): audi/lib/audi/control/client.ex:797-800 | lilly/lib/lilly/control/client.ex:939-942 | porsche/lib/porsche/client.ex:264-267 | ziggy/lib/ziggy/control.ex:114-117 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"086ed80574f2ce314358a034499e391713051d55c0742e57154e9fafcfac0ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): audi/lib/audi/dns/authority.ex:89-89 | audi/lib/audi/private/dns.ex:31-31 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"audi/lib/audi/dns/authority.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe8c3e41bbcb9e972e1e492c515a146fd879d062df5d2be951301abc7b4179b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): audi/lib/audi/ssh/channel.ex:35-36 | porsche/lib/porsche/ssh/channel.ex:37-38 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"audi/lib/audi/ssh/channel.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0080194ed9352e194247fb04da3ea36d9c682ce0254114d2f4fe9f0940aa933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lilly/lib/lilly/transfer/readiness_probe.ex:54-60 | lilly/lib/lilly/transfer/source_cleanup.ex:101-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/readiness_probe.ex"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"616618f2a6bbf9b0849361221334bece12629fa75c77e06487a37d89679eb509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): marshall/lib/marshall/editor/authority.ex:570-570 | marshall/lib/marshall/ingress/web_logins.ex:267-267 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f26d648b02972402f434855dff79cf5e1ad2b989736810717d5f69ea523552d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/ingress/acme/issuer.ex:154-157 | protocol/lib/overalls_protocol.ex:48-51 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/issuer.ex"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"437523694775d367c5d66272a674fd339b64c873ab9df6ce35dcf863fa2cdf8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex:291-291 | marshall/lib/marshall_web/live/threads_live.ex:832-833 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc702adef53cef327ab4b91cfecdaaebcf176418fc92495cdf5c507fcd23d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/terminal/metrics.ex:13-14 | marshall/lib/marshall/terminal/metrics.ex:7-8 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/terminal/metrics.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"839cef43819038aced826a1d16f59a1aa02c677aeb9926d135ad18adf92e31a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): marshall/lib/marshall/agents/context.ex:697-697 | marshall/lib/marshall/agents/server_tool.ex:56-56 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2991fdcace1bc685fffdf18f70d5992013ef0cf568d18b2d71d61a4cae66b2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/galileo/credentials.ex:86-89 | marshall/lib/marshall/peach/credentials.ex:86-89 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"985e05baaf55364709eb733cb08ccb795b98eba9d787e45ca5ce00093c4fc6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): marshall/lib/marshall/repo.ex:29-31 | susan/lib/susan/repo.ex:17-19 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/repo.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3f2092003d54a9ab5fd8f45f3d73ec4cccfcbee6c724f6a7bb94ebe2e4c175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): marshall/lib/marshall/ssh.ex:52-56 | marshall/lib/marshall/teams.ex:32-36 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be1a2eca806cc3ea9f60313027f1e04d50400c8e7eaf9a4c9f9e0aa85bda5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall/teams/coordinator.ex:564-567 | marshall/lib/marshall/teams/transfer_swap.ex:24-27 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/teams/coordinator.ex"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627e8fb7d31b5c80678f0c21fa7d89fbf40177b47aa65c1ef355ed8f9ed6778"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): audi/lib/audi/privacy.ex:60-60 | porsche/lib/porsche/privacy.ex:51-51 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"audi/lib/audi/privacy.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"419707936aa1aa32268aea6c166d07b253fa4c3b73be131eb6cfc186cf6983b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lilly/lib/lilly/clone/runtime.ex:170-171 | lilly/lib/lilly/transfer/source_runtime.ex:128-129 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lilly/lib/lilly/clone/runtime.ex"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7a81ba6487521086a851171ce424ddb232cc3633dc1b37dbf2038a8cd1f769"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): lilly/lib/lilly/ingress/server.ex:163-164 | lilly/lib/lilly/network/attribution_server.ex:123-124 | lilly/lib/lilly/private/server.ex:123-124 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a501ec1a1d0afc9264032ef5fb8ecd49a65af0bb2390999d84d704ec2b9e0073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): lilly/lib/lilly/transfer/probe_request.ex:11-13 | lilly/lib/lilly/vm/disk.ex:384-386 | protocol/lib/overalls_protocol/github.ex:245-247 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/probe_request.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43f94da1c685fb5be9e7333f0e23e383fd93e01a511db8442c2c3766dceac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lilly/native/hostd/src/policy.rs:47-52 | lilly/native/hostd/src/transfer.rs:347-351 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0452ae40c6af4a9253b4536672412173770800a9b4d41772c62c5d7dad172a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/agents/compaction.ex:333-334 | marshall/lib/marshall/agents/model_protocol.ex:394-395 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/agents/compaction.ex"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17039bc1054ef35f4491fc09745646e1cf2feecb62c943532b6fde2f46186b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): marshall/lib/marshall/compute/cloning.ex:55-55 | marshall/lib/marshall/compute/lifecycle.ex:334-334 | marshall/lib/marshall/compute/relocation_admission.ex:103-103 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/cloning.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81fb2f079acf8e70953592d3a0955e95b0f6c9f2815a7a18748fb50bc7f795a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/ingress/catalog.ex:107-108 | marshall/lib/marshall/ingress/publications.ex:336-337 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/ingress/catalog.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"87470c6844224811daeec290a80d7bb53e705469b366749487f0ebb81845973b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/ingress/sessions.ex:259-260 | marshall/lib/marshall/ssh/authority.ex:452-453 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/ingress/sessions.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ad64670375034e588a26614f2aad28622fbf378f0865c5e3923c6e76ff8389"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): marshall/lib/marshall_web/admin_elevation.ex:194-197 | marshall/lib/marshall_web/live/admin/lilly_nodes_live.ex:878-881 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/admin_elevation.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"261e06e65baddc35d274f1a5d8167e035fa41a74277cab3b9900ae99319f7317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): mila/native/linux/src/pages.rs:228-233 | mila/native/linux/src/views.rs:109-114 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/pages.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d339e79a826156b209bc1985190ec522cca857787d10afb9b4fae5a0109f6bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): antithesis/sdk/lib/overalls_antithesis/sdk/writer.ex:203-206 | marshall/lib/marshall/operations/git_hub_config.ex:52-53 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"antithesis/sdk/lib/overalls_antithesis/sdk/writer.ex"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518adb1ba413550ec915211fb5887bab603c9eed0b7ba6ea5ab4ed0639004a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 2\u002B corresponding lines): audi/lib/audi/dns/server.ex:126-127 | audi/lib/audi/relay/server.ex:89-90 | audi/lib/audi/tls/readiness.ex:105-106 | brady/lib/brady/listener.ex:81-82 | lilly/lib/lilly/inception/runtime.ex:89-90 | lilly/lib/lilly/network/attribution_server.ex:120-121 | lilly/lib/lilly/private/server.ex:120-121 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/server.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bed925b39a9c55f473d32f00b870901827e571e300b37d6718ce3f15b55cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex:66-67 | elixir/diagnostics/lib/overalls/diagnostics/metrics.ex:363-364 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ebf7b2585e2b4e85cb64a317d5abfc6e363191d42aa006a2738cde5735fb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/compute/clone_placement.ex:226-227 | marshall/lib/marshall/compute/relocation_capacity.ex:336-337 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/compute/clone_placement.ex"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d5776ee3b4271008f3c14ad425062831f499f4447b0d09b97492e39eac91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): marshall/lib/marshall/ingress/control_requests.ex:93-93 | marshall/lib/marshall/ssh/control_requests.ex:52-53 | marshall/lib/marshall_web/ingress_api.ex:121-122 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/control_requests.ex"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"187cf4d814045bd51c17b67f94b886a61dc4756a7e4d125251f07bf35d0e407f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall_web/components/workspace_components.ex:77-78 | marshall/lib/marshall_web/live/machines_live.ex:786-787 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall_web/components/workspace_components.ex"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f50d37cc4369f002ce5e5f72ac9fa495f01f591cb3b0242f592a12899f902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall_web/live/machines_live.ex:444-445 | marshall/lib/marshall_web/live/threads_live.ex:544-545 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f623a23ae89fd2bc315bb233fceb3db070cb940f2ab11ffd064f4501227e3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): marshall/lib/marshall/accounts/scim_retirement.ex:66-67 | marshall/lib/marshall/compute/host_reports.ex:247-248 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"marshall/lib/marshall/accounts/scim_retirement.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e7c9d6682d41c6e475b229cf12af604423e9ea83e0a32d6a5da3499001c3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): marshall/lib/marshall/enrico/catalog.ex:126-126 | marshall/lib/marshall/galileo/ownership.ex:14-15 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"marshall/lib/marshall/enrico/catalog.ex"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2082324e028b8ab46a6e9aebe1709f84c705767c2b5777faf672d3d4cb0bfd94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): galileo/lib/galileo/github/http.ex:513-515 | marshall/lib/marshall_web/security_headers.ex:103-103 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"galileo/lib/galileo/github/http.ex"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b23e4694b8ea59e4153d9191c09774afdce4b4b521639c1ba887faf3ed56c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): marshall/lib/marshall/compute/relocation_receives.ex:31-85 | marshall/lib/marshall/compute/relocation_sources.ex:30-84 \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":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbad580153126758bfb2619b02d641573584a507157dd04c34619ee556a27623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): lilly/lib/lilly/vm/executor.ex:451-490 | lilly/lib/lilly/vm/executor.ex:516-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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a10c529854a490b74c384a6bda5b1c39039727e2526e2e5b9bc112bd7110962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): marshall/lib/marshall/ingress/services.ex:34-69 | marshall/lib/marshall/ingress/services.ex:81-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/services.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"938387375e67064a990f73f423af4791e6338180475c07f62fe1ac8e2c02c94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): audi/lib/audi/http/browser.ex:55-87 | audi/lib/audi/http/editor_browser.ex:55-87 \u2014 before extracting anything, compare \u0060audi/lib/audi/http/browser.ex\u0060 and \u0060audi/lib/audi/http/editor_browser.ex\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be80115861f07410998293ba663d5f80315aae66944d9c22ba044ba266c895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): marshall/lib/marshall/galileo/credentials.ex:18-46 | marshall/lib/marshall/inference/credentials.ex:19-47 | marshall/lib/marshall/peach/credentials.ex:18-46 \u2014 \u0060marshall/lib/marshall/galileo/credentials.ex\u0060 and \u0060marshall/lib/marshall/peach/credentials.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/galileo/credentials.ex:18\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":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa140743a6707851e4714a3b242f2c6f80c1544cf405a46f9a35b5ca0b759087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): marshall/lib/marshall/galileo/authorizations.ex:201-227 | marshall/lib/marshall/inference/requests.ex:206-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/galileo/authorizations.ex:201\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":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45ebe897a2acd6252a511559113c4d267f2c7ee8f92cfd81ed91a5f5c0f472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): porsche/scripts/host_certificate_boot_probe.exs:51-76 | porsche/scripts/invalid_boot_probe.exs:42-67 \u2014 before extracting anything, compare \u0060porsche/scripts/host_certificate_boot_probe.exs\u0060 and \u0060porsche/scripts/invalid_boot_probe.exs\u0060 as WHOLE FILES: this scan already matched 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060porsche/scripts/host_certificate_boot_probe.exs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/scripts/host_certificate_boot_probe.exs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f60edd3f1f279172b14652f9a426bba81dd89e159484b81f7ca22dd5bbbfb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): protocol/lib/overalls_protocol/image_manifest.ex:498-523 | protocol/lib/overalls_protocol/image_manifest.ex:557-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060protocol/lib/overalls_protocol/image_manifest.ex:498\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":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee6873a9b873c57d58bb40fd3718bfa6f288fd213bc5316f7c2c549797b09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 3): enrico/scripts/invalid_boot_probe.exs:24-47 | galileo/scripts/invalid_boot_probe.exs:24-48 | ziggy/scripts/invalid_boot_probe.exs:25-48 \u2014 before extracting anything, compare \u0060enrico/scripts/invalid_boot_probe.exs\u0060 and \u0060galileo/scripts/invalid_boot_probe.exs\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060galileo/scripts/invalid_boot_probe.exs:24\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":"enrico/scripts/invalid_boot_probe.exs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe52450524533a3685b8e7c9abb4f2b5c4adf2624bdfcd45353ce9b5a07dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): marshall/lib/marshall_web/controllers/audi_login_controller.ex:21-45 | marshall/lib/marshall_web/controllers/editor_controller.ex:46-69 \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 \u0060marshall/lib/marshall_web/controllers/audi_login_controller.ex:21\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":"marshall/lib/marshall_web/controllers/audi_login_controller.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb58704483f2148d8ce1e701c5ba3bd3cbc89d33470c049ab430c106e72a4b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:69-92 | lilly/lib/lilly/host/ownership.ex:101-124 \u2014 before extracting anything, compare \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex\u0060 and \u0060lilly/lib/lilly/host/ownership.ex\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:69\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":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dcf9603d7e1af26ba2532bcbfe1eb3c634ba71131caf2bba964590eff4493c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): brady/scripts/invalid_boot_probe.exs:45-66 | porsche/scripts/host_certificate_boot_probe.exs:53-75 | porsche/scripts/invalid_boot_probe.exs:44-66 \u2014 before extracting anything, compare \u0060porsche/scripts/host_certificate_boot_probe.exs\u0060 and \u0060porsche/scripts/invalid_boot_probe.exs\u0060 as WHOLE FILES: this scan already matched 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060porsche/scripts/host_certificate_boot_probe.exs:53\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":"brady/scripts/invalid_boot_probe.exs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94781f5ac1ca021848b76599a8b48d00206d57df3b9814e0ddbd6516bfc3009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): audi/lib/audi/relay/server.ex:107-128 | lilly/lib/lilly/ingress/server.ex:323-344 | lilly/lib/lilly/network/attribution_server.ex:151-172 | lilly/lib/lilly/private/server.ex:151-172 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060audi/lib/audi/relay/server.ex:107\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":"audi/lib/audi/relay/server.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf105a7f64f9c3553ed872012f3c69debadd422d89b745ebd502e6f23aa580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): audi/lib/audi/http/browser.ex:22-43 | audi/lib/audi/http/editor_browser.ex:22-43 \u2014 before extracting anything, compare \u0060audi/lib/audi/http/browser.ex\u0060 and \u0060audi/lib/audi/http/editor_browser.ex\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00f724a88e51ef4ba438bc3aa05adf481577d18f6c7c0c5be1d28995c314759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): mila/windows-dotnet/MainWindow.xaml.cs:424-444 | mila/windows-dotnet/MainWindow.xaml.cs:482-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/MainWindow.xaml.cs:424\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mila/windows-dotnet/MainWindow.xaml.cs:445\u0060 calls \u0060BindWebNavigationFence\u0060 and \u0060mila/windows-dotnet/MainWindow.xaml.cs:502\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":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd8c8fe9e90f48955442fd1f22a060ab94548ce9bb2171409a25974a5faf12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:27-45 | lilly/lib/lilly/host/ownership.ex:30-48 \u2014 before extracting anything, compare \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex\u0060 and \u0060lilly/lib/lilly/host/ownership.ex\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:27\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":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a88d27002c3aba304f0f5e06fe6a0955d39dece4fa69a07c881c2f60e15d166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): lilly/lib/lilly/control/runtime.ex:875-891 | lilly/lib/lilly/control/runtime.ex:1034-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/control/runtime.ex:1034\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":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb05eaf0d1f04a1980a0b89e7863d673362bbd20086a8666848e0e842145074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): marshall/lib/marshall_web/live/admin/users_live.ex:37-55 | marshall/lib/marshall_web/live/admin/users_live.ex:64-78 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall_web/live/admin/users_live.ex:37\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":"marshall/lib/marshall_web/live/admin/users_live.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e9b7b4a0a39707c4f3c49ebd15946ad1de686f7b1c4b54e5e1a3e2a64ea1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): nix/domains/artifacts/guest/native-promotion/test_verify.exs:403-420 | nix/domains/artifacts/guest/native-promotion/verify.ex:201-219 \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 \u0060nix/domains/artifacts/guest/native-promotion/test_verify.exs:403\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":"nix/domains/artifacts/guest/native-promotion/test_verify.exs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"892c4fc01cb52a65dcff14c93230dae1bac8f65dcc16d4ce888c2fd1e758f79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): protocol/lib/overalls_protocol/workload_bundle.ex:237-255 | protocol/lib/overalls_protocol/workload_bundle.ex:281-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060protocol/lib/overalls_protocol/workload_bundle.ex:237\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":"protocol/lib/overalls_protocol/workload_bundle.ex"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7450011ee332a90dcf103c4733d28c25d9129b30b2e87f7b02b81fafcaee3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): audi/lib/audi/otp_reports.ex:18-35 | lilly/lib/lilly/otp_reports.ex:18-35 | marshall/lib/marshall/otp_reports.ex:18-35 | porsche/lib/porsche/otp_reports.ex:18-35 \u2014 before extracting anything, compare \u0060audi/lib/audi/otp_reports.ex\u0060 and \u0060lilly/lib/lilly/otp_reports.ex\u0060 as WHOLE FILES: 93% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/otp_reports.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03ea0e3872a1919315f2b352fcc91c5a89267c10826cd0da2c19ab7099830c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): audi/lib/audi/relay/server.ex:69-86 | lilly/lib/lilly/ingress/server.ex:117-134 | lilly/lib/lilly/network/attribution_server.ex:100-117 | lilly/lib/lilly/private/server.ex:100-117 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/relay/server.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb59eebd16b69f18df0dd3264ed0faf1aa2779db1ebf140fc4332c11b491e9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201318 lines \u00D7 3): marshall/lib/marshall_web/browser_messages.ex:44-61 | marshall/lib/marshall_web/browser_messages.ex:64-72 | marshall/lib/marshall_web/browser_messages.ex:79-85 \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 \u0060marshall/lib/marshall_web/browser_messages.ex:44\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":"marshall/lib/marshall_web/browser_messages.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb39a492aec1218cbfc33182805b927bad999a83cdbf04293e555f0b25c23539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): audi/lib/audi/slo.ex:62-79 | marshall/lib/marshall/slo.ex:107-124 \u2014 before extracting anything, compare \u0060audi/lib/audi/slo.ex\u0060 and \u0060marshall/lib/marshall/slo.ex\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":"audi/lib/audi/slo.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb6c9964330b2f5eb672a76d05ffcd18c829520aff29b4279e7bdc48c53cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:150-167 | marshall/lib/marshall/ingress/acme/material.ex:150-167 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee10609e04f3e9546c32400af26049900aeabf2e2dc2d6b3bcdf2a7b6e74066a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): marshall/lib/marshall/compute/lifecycle.ex:243-260 | marshall/lib/marshall/compute/relocation_admission.ex:83-100 \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 \u0060marshall/lib/marshall/compute/lifecycle.ex:243\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":"marshall/lib/marshall/compute/lifecycle.ex"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"13129a59e107bc84b2e5000cfd29220a1f26e97a5b62140fbf571d97e0cd3f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): marshall/lib/marshall/ingress/web_streams.ex:47-64 | marshall/lib/marshall/ingress/web_streams.ex:128-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. 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":"marshall/lib/marshall/ingress/web_streams.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78400808c1b0018a0abe4abd78b027459b53fa1ba4d4939b8d8b6992cb00d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): marshall/lib/marshall/terminal/peer_socket.ex:196-213 | marshall/lib/marshall/terminal/remote.ex:297-314 \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":"marshall/lib/marshall/terminal/peer_socket.ex"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfcb92679b6997b9c358f37d095a77bd9f2fb9295be53f626189f12fa92ec94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lilly/lib/lilly/control/runtime.ex:277-292 | lilly/lib/lilly/control/runtime.ex:1063-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. 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":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"061141e3bfd6f1307c5eb5cdba1605d380d4cd18143bf505524ffe9769ee4ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lilly/lib/lilly/inception/runtime.ex:151-167 | lilly/lib/lilly/inception/runtime.ex:178-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":"lilly/lib/lilly/inception/runtime.ex"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb764bc1465d6f4e9be6808185ac01f6b20f114c179c236879794bf2fe54aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): marshall/lib/marshall/access/sharing.ex:100-116 | marshall/lib/marshall/threads/sharing.ex:98-114 \u2014 \u0060marshall/lib/marshall/access/sharing.ex\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall/threads/sharing.ex:117\u0060 calls \u0060list\u0060, \u0060t\u0060 and \u0060marshall/lib/marshall/access/sharing.ex:119\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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42b23e6afb9566337b1c51a8eb394b0ab62a28425d66ab17839c7d0ff34ed80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): marshall/lib/marshall/operations/executor_bootstrap.ex:63-79 | marshall/lib/marshall/operations/git_hub_tools.ex:64-80 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/operations/executor_bootstrap.ex\u0060 and \u0060marshall/lib/marshall/operations/git_hub_tools.ex\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060marshall/lib/marshall/operations/git_hub_tools.ex:63\u0060 calls \u0060flatten\u0060 and \u0060marshall/lib/marshall/operations/executor_bootstrap.ex:62\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":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08387d78f9a3ab0ef0d2723e6c502e735272d909da1fe783f001ee8e50677e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): marshall/lib/marshall_web/live/threads_live.ex:415-431 | marshall/lib/marshall_web/live/threads_live.ex:436-446 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall_web/live/threads_live.ex:415\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":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9955e21d63ce041849c686e5a21cd995ade8aa52c13ab621ed9c0816cf1b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 12): lilly/lib/lilly/control/client.ex:270-284 | lilly/lib/lilly/control/client.ex:320-334 | lilly/lib/lilly/control/client.ex:370-384 | lilly/lib/lilly/control/client.ex:420-434 | lilly/lib/lilly/control/client.ex:470-484 | lilly/lib/lilly/control/client.ex:518-532 | lilly/lib/lilly/control/client.ex:566-580 | lilly/lib/lilly/control/client.ex:614-629 | lilly/lib/lilly/control/client.ex:674-688 | lilly/lib/lilly/control/client.ex:722-736 | lilly/lib/lilly/control/client.ex:772-786 | lilly/lib/lilly/control/client.ex:822-836 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/control/client.ex:270\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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e2c0aac72ea2b72d01a9d9f5cd77b9955b697fe7b8189a5eb8169f40fd8a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201316 lines \u00D7 4): marshall/lib/marshall_web/live/admin/access_live.ex:25-32 | marshall/lib/marshall_web/live/admin/access_live.ex:37-44 | marshall/lib/marshall_web/live/admin/access_live.ex:49-56 | marshall/lib/marshall_web/live/admin/workloads_live.ex:46-61 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/live/admin/workloads_live.ex: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":"marshall/lib/marshall_web/live/admin/access_live.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b897053f4ddba5542849491ade6aee85ca36e6461a41f0f08002d30748be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): enrico/scripts/invalid_boot_probe.exs:97-109 | galileo/scripts/invalid_boot_probe.exs:98-110 | ziggy/scripts/invalid_boot_probe.exs:93-108 \u2014 before extracting anything, compare \u0060enrico/scripts/invalid_boot_probe.exs\u0060 and \u0060galileo/scripts/invalid_boot_probe.exs\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ziggy/scripts/invalid_boot_probe.exs:93\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":"enrico/scripts/invalid_boot_probe.exs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfdb42533c08a7095d685af319460c43a572804a996dd349d0be11225760c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): audi/lib/audi/http/listener.ex:56-71 | audi/lib/audi/private/listener.ex:26-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/http/listener.ex:56\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":"audi/lib/audi/http/listener.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d94a62694eff260fe28487006bbccfc4fc37dbd74be42756601c60e778ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): marshall/lib/marshall/observability.ex:181-196 | marshall/lib/marshall/observability.ex:198-213 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/observability.ex:181\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":"marshall/lib/marshall/observability.ex"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d505fe37317b2053895f532297699c1ddd9da0a2e15a9abd8aaf6a978adc87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): marshall/lib/marshall_web/android_display_socket.ex:32-47 | marshall/lib/marshall_web/terminal_socket.ex:28-43 \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 \u0060marshall/lib/marshall_web/android_display_socket.ex:32\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":"marshall/lib/marshall_web/android_display_socket.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c15446c2a3a0edc27e3f3c9ff6dc652d109c3307e878335cb723d6ee51e956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): porsche/scripts/host_certificate_boot_probe.exs:162-177 | porsche/scripts/invalid_boot_probe.exs:117-132 \u2014 before extracting anything, compare \u0060porsche/scripts/host_certificate_boot_probe.exs\u0060 and \u0060porsche/scripts/invalid_boot_probe.exs\u0060 as WHOLE FILES: this scan already matched 3 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":"porsche/scripts/host_certificate_boot_probe.exs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"864af7eee5e256b3c67f23e3bfb3c56643513e7fb95c6271e2998af02d2f5531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): audi/lib/audi/status_server.ex:105-124 | lilly/lib/lilly/control/status_server.ex:98-117 | porsche/lib/porsche/status_server.ex:67-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/status_server.ex:105\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":"audi/lib/audi/status_server.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8456fe56373587a9be95e18c36da97ec5417e5ff24fc6ed275a6a697f3c7e037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): audi/lib/audi/http/authority.ex:57-71 | audi/lib/audi/inception/authority.ex:62-76 \u2014 \u0060audi/lib/audi/http/authority.ex\u0060 and \u0060audi/lib/audi/inception/authority.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 27 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/http/authority.ex:57\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":"audi/lib/audi/http/authority.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea95f6f13f72ce154333c7b359414e40b7f1b83e8df4ea989c958f0ea88ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): audi/lib/audi/ssh/listener.ex:69-83 | porsche/lib/porsche/listener.ex:84-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/ssh/listener.ex:69\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":"audi/lib/audi/ssh/listener.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449bbc15a90f78312c6e9af77b68ddadbf639a23552f432ada718a17b93f325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): marshall/lib/marshall/compute/admission.ex:340-354 | marshall/lib/marshall/galileo/configurations.ex:394-408 \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":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa25f6d7ac63fde17c4268ce522c45af27a182ee3a32ca6144e988790638ef38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): marshall/lib/marshall/compute/relocation_destination_revocations.ex:19-33 | marshall/lib/marshall/compute/relocation_revocations.ex:19-33 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_revocations.ex\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":"marshall/lib/marshall/compute/relocation_destination_revocations.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"41164542b39fa6a7a4f3a7c503390d867e156b079d6c47cbd9e498a6e8960b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): marshall/lib/marshall/ssh/guest_access.ex:36-50 | marshall/lib/marshall/ssh/guest_access.ex:86-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/ssh/guest_access.ex:36\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":"marshall/lib/marshall/ssh/guest_access.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e0e834fdc00cae54d1039fbb4f2653c50fb0809249cdd1b97ad37801d13ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): marshall/lib/marshall_web/live/machines_live.ex:361-372 | marshall/lib/marshall_web/live/machines_live.ex:390-404 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall_web/live/machines_live.ex:361\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060marshall/lib/marshall_web/live/machines_live.ex:389\u0060 calls \u0060assign\u0060, \u0060generate\u0060 and \u0060marshall/lib/marshall_web/live/machines_live.ex:360\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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"902307533a92c4a06b075901c2d52226dbee5ce8c251c0f0d02f60594090a98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): protocol/lib/overalls_protocol/relocation_destination_revocation.ex:35-48 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:34-47 | protocol/lib/overalls_protocol/relocation_revocation.ex:34-47 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:37-50 \u2014 before extracting anything, compare \u0060protocol/lib/overalls_protocol/relocation_destination_revocation.ex\u0060 and \u0060protocol/lib/overalls_protocol/relocation_key_retirement.ex\u0060 as WHOLE FILES: 93% 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":"protocol/lib/overalls_protocol/relocation_destination_revocation.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d66a3c5f2e68bb7e48fd66e6e8ebb5464b4bb0191959d84b62e7ffbd48499b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): audi/lib/audi/config.ex:407-420 | porsche/lib/porsche/config.ex:121-134 \u2014 before extracting anything, compare \u0060audi/lib/audi/config.ex\u0060 and \u0060porsche/lib/porsche/config.ex\u0060 as WHOLE FILES: this scan already matched 5 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":"audi/lib/audi/config.ex"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5f2d15a1e49a781eddbdee225f4cca156916ad35684cd15257878487b3879c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): audi/lib/audi/slo.ex:124-137 | marshall/lib/marshall/slo.ex:172-185 \u2014 before extracting anything, compare \u0060audi/lib/audi/slo.ex\u0060 and \u0060marshall/lib/marshall/slo.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/slo.ex:124\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":"audi/lib/audi/slo.ex"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"14721eed1b7565eae2770dbe74597d80c798486cfd6b3422caf0ad0bf019d9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lilly/lib/lilly/network/attribution_server.ex:42-55 | lilly/lib/lilly/private/server.ex:39-52 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 and \u0060lilly/lib/lilly/private/server.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/network/attribution_server.ex:42\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":"lilly/lib/lilly/network/attribution_server.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fa6e57f91481b5526f62ae9cf8f466ebfcf3c7b47f895f0f3b8ef0f6e1b3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): marshall/lib/marshall/compute/relocation_revocations.ex:79-92 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:84-97 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_revocations.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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 \u0060marshall/lib/marshall/compute/relocation_revocations.ex:79\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":"marshall/lib/marshall/compute/relocation_revocations.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24da984c1b84ba5f9c9267f53f1ddcaee481f423fd4eda8530749f3f72c4ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): marshall/lib/marshall_web/live/machines_live.ex:268-276 | marshall/lib/marshall_web/live/machines_live.ex:356-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/live/machines_live.ex:268\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":"marshall/lib/marshall_web/live/machines_live.ex"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9362fbb9d5d82e27e7706e922bfc9540fd2c423e4213c57fd07f8a41cab690e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): marshall/lib/marshall/compute/relocation_destination_cleanups.ex:37-49 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:31-43 | marshall/lib/marshall/compute/relocation_imports.ex:41-53 | marshall/lib/marshall/compute/relocation_key_retirement.ex:29-41 | marshall/lib/marshall/compute/relocation_readiness.ex:40-52 | marshall/lib/marshall/compute/relocation_revocations.ex:31-43 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:32-44 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\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. If that is what happened, the fix is to keep one copy and have the other 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 \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex:37\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":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf193ce9122dd8ad7ab3e348b5e5b97b2e9ede508e60c7f3a7208d63910709d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:49-73 | marshall/lib/marshall/ingress/acme/material.ex:49-73 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"131378cc3d92bc6355d21b32ac7440b17e292c299cb49a24ce4aaabec2918f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): audi/scripts/invalid_boot_probe.exs:29-41 | marshall/scripts/invalid_runtime_boot_probe.exs:64-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":"audi/scripts/invalid_boot_probe.exs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"178ee646f37c49ea28f1920a6777bc8d6ea348fdc7553b980e8c183c17bbb508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): lilly/lib/lilly/transfer/checkpoint_transfer.ex:403-413 | lilly/lib/lilly/transfer/receiver.ex:140-152 \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 \u0060lilly/lib/lilly/transfer/checkpoint_transfer.ex:403\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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a900a26f484928611df51ddf2fa8c5f66783c1857fc2fbbf1f5cd30f88acc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lilly/lib/lilly/vm/executor.ex:424-435 | lilly/lib/lilly/vm/executor.ex:494-506 \u2014 both copies are in the same file, so extract the block 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 \u0060lilly/lib/lilly/vm/executor.ex:424\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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f97e22a84497715d989373b171e1c3dba18ba0a4f4e072b845e09a55507d5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): marshall/lib/marshall/ingress/routes.ex:49-61 | marshall/lib/marshall/ingress/routes.ex:145-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall/ingress/routes.ex:62\u0060 calls \u0060compare\u0060 and \u0060marshall/lib/marshall/ingress/routes.ex:158\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":"marshall/lib/marshall/ingress/routes.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d7832cdf8a3d1623b939260f02f6ee2b369732f8f528fe8df891a8914a59bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): marshall/lib/marshall_web/live/account_live.ex:186-198 | marshall/lib/marshall_web/live/account_live.ex:203-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":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac719c9ba274d9cceec552c780c14925ab92d13196017a445690ef4856e63fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): nix/domains/artifacts/guest/native-promotion/test_verify.exs:422-434 | nix/domains/artifacts/guest/native-promotion/verify.ex:221-233 \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":"nix/domains/artifacts/guest/native-promotion/test_verify.exs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacfab4aaddafaf9aeecc85e3f0150e46c6df09fa834ac9a965433ea19cfebcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): lilly/lib/lilly/transfer/checkpoint_transfer.ex:246-256 | lilly/lib/lilly/vm/checkpoint_storage.ex:351-361 | lilly/lib/lilly/vm/checkpoint_storage.ex:574-585 \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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f480994e8a0244040b236e19c0b8e93a0861d30e14d8386f35def0cf7d606aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): marshall/lib/marshall_web/live/integrations_live.ex:70-79 | marshall/lib/marshall_web/live/integrations_live.ex:84-95 | marshall/lib/marshall_web/live/integrations_live.ex:100-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/live/integrations_live.ex:84\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":"marshall/lib/marshall_web/live/integrations_live.ex"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4709d5c7b695488934bc37829eb15e619b0c263d6a6374711dfd2f5f6494d330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): mila/windows-dotnet/Interop/ThreadListing.cs:99-110 | mila/windows-dotnet/Interop/ThreadListing.cs:135-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/ThreadListing.cs:135\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":"mila/windows-dotnet/Interop/ThreadListing.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8619f3eaba05c93c5b51f953bab119efd750db68772e1e2c67cc25d0c3dd764c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): audi/lib/audi/http/authority.ex:17-26 | audi/lib/audi/inception/authority.ex:17-28 \u2014 \u0060audi/lib/audi/http/authority.ex\u0060 and \u0060audi/lib/audi/inception/authority.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 27 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/http/authority.ex:17\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":"audi/lib/audi/http/authority.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b47cf1dd97db141fc3a5a986c517f3fa8d646439d449744321b1133b41082b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): audi/lib/audi/slo.ex:105-116 | marshall/lib/marshall/slo.ex:153-164 \u2014 before extracting anything, compare \u0060audi/lib/audi/slo.ex\u0060 and \u0060marshall/lib/marshall/slo.ex\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":"audi/lib/audi/slo.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e80e16374c15e12630686aef4aa12d81de628d75c03849c6d802761534ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): audi/lib/audi/slo.ex:193-204 | marshall/lib/marshall/slo.ex:242-253 \u2014 before extracting anything, compare \u0060audi/lib/audi/slo.ex\u0060 and \u0060marshall/lib/marshall/slo.ex\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":"audi/lib/audi/slo.ex"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e08e8b9c99f2b8f32c60ad28a6c01e0554595e9559aee6277d2c61a7cd03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): audi/lib/audi/ssh/proof.ex:20-33 | porsche/lib/porsche/ssh/proof.ex:12-25 \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":"audi/lib/audi/ssh/proof.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f762768cb98ff113d817e87435512358c5c17a4d7edbac8d660291a9a3344f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): galileo/lib/galileo/config.ex:11-21 | ziggy/lib/ziggy/config.ex:26-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ziggy/lib/ziggy/config.ex:26\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/config.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bfbc5b1ad8da5d4981a9800759e0c5c9c4784a5e2236237b5d110db06fc90b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lilly/lib/lilly/transfer/key_runtime.ex:112-123 | lilly/lib/lilly/transfer/source_runtime.ex:134-145 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/key_runtime.ex\u0060 and \u0060lilly/lib/lilly/transfer/source_runtime.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/transfer/key_runtime.ex:112\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":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b54d0434619c875eebe9c5f02f471ef8f64062d42c1e8d44ba9fb625bc1cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): marshall/lib/marshall/compute/relocation_destination_revocations.ex:81-94 | marshall/lib/marshall/compute/relocation_key_retirement.ex:78-89 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_key_retirement.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex:81\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":"marshall/lib/marshall/compute/relocation_destination_revocations.ex"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c6247e6e12d70bb9f7c9d99b77b653b05d1bee2003d0fb664810d671cbb981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): marshall/lib/marshall/compute/relocation_receives.ex:265-276 | marshall/lib/marshall/compute/relocation_sources.ex:241-252 \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":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad622b52592ca1fe1821cb9b86639918834c19504ec32a5db38dcf176ee478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): marshall/lib/marshall_web/gettext_interpolation.ex:20-31 | porsche/lib/porsche/gettext_interpolation.ex:20-31 \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":"marshall/lib/marshall_web/gettext_interpolation.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"53734a65a52602454216bb26f222338061016bef23b29026aa42154bbdab8141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): protocol/lib/overalls_protocol/editor_stream.ex:51-62 | protocol/lib/overalls_protocol/web_stream.ex:57-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":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c71d51f1e8ca80bbf4460fa26e87b817c63c6f4f811aa84049532aeac34cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ziggy/lib/ziggy/http.ex:205-216 | ziggy/lib/ziggy/http.ex:234-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":"ziggy/lib/ziggy/http.ex"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afcbde02fcf16ebf98adf95d3370a963a79e8c6ae6bcc6c88ac8fc150a3d045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13): lilly/lib/lilly/control/client.ex:144-154 | lilly/lib/lilly/control/client.ex:273-283 | lilly/lib/lilly/control/client.ex:323-333 | lilly/lib/lilly/control/client.ex:373-383 | lilly/lib/lilly/control/client.ex:423-433 | lilly/lib/lilly/control/client.ex:473-483 | lilly/lib/lilly/control/client.ex:521-531 | lilly/lib/lilly/control/client.ex:569-579 | lilly/lib/lilly/control/client.ex:617-627 | lilly/lib/lilly/control/client.ex:677-687 | lilly/lib/lilly/control/client.ex:725-735 | lilly/lib/lilly/control/client.ex:775-785 | lilly/lib/lilly/control/client.ex:825-835 \u2014 all 13 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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb126b217af73761dd101532000abd0a77e5c3cbf7823de3835836fed6011e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 12): protocol/lib/overalls_protocol/relocation_cleanup.ex:106-116 | protocol/lib/overalls_protocol/relocation_destination_cleanup.ex:88-98 | protocol/lib/overalls_protocol/relocation_destination_revocation.ex:100-110 | protocol/lib/overalls_protocol/relocation_import.ex:42-52 | protocol/lib/overalls_protocol/relocation_key_retirement.ex:99-109 | protocol/lib/overalls_protocol/relocation_keys.ex:108-118 | protocol/lib/overalls_protocol/relocation_readiness.ex:111-121 | protocol/lib/overalls_protocol/relocation_receive.ex:100-110 | protocol/lib/overalls_protocol/relocation_revocation.ex:99-109 | protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex:102-112 | protocol/lib/overalls_protocol/relocation_source.ex:119-129 | protocol/lib/overalls_protocol/terminal.ex:694-704 \u2014 before extracting anything, compare \u0060protocol/lib/overalls_protocol/relocation_destination_revocation.ex\u0060 and \u0060protocol/lib/overalls_protocol/relocation_key_retirement.ex\u0060 as WHOLE FILES: 93% 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 \u0060protocol/lib/overalls_protocol/relocation_cleanup.ex:106\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":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2f8ae0cef2ff46963bef7d456c981c2acdec0ba4507db54f1af82b324e14c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lilly/lib/lilly/ingress/server.ex:407-417 | lilly/lib/lilly/network/attribution_server.ex:209-219 | lilly/lib/lilly/private/server.ex:261-271 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lilly/lib/lilly/ingress/server.ex:407\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, \u0060lilly/lib/lilly/private/server.ex:256\u0060 calls \u0060send_frame\u0060, \u0060send\u0060, \u0060wire\u0060 and \u0060lilly/lib/lilly/ingress/server.ex:404\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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f55289b9d502e7ee9b13a97032d983e9c76415580d0d4c2d04c71d9ef57f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): lilly/lib/lilly/network/ingress.ex:22-31 | lilly/lib/lilly/network/ingress.ex:87-96 | lilly/lib/lilly/network/ingress.ex:192-202 \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":"lilly/lib/lilly/network/ingress.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683bf57819fd2f6ffaff2f65811f310ecb76a9b7ba55c6feba9c700ccbb4b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): marshall/lib/marshall_web/browser_messages.ex:21-28 | marshall/lib/marshall_web/browser_messages.ex:65-75 | marshall/lib/marshall_web/browser_messages.ex:80-86 \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 \u0060marshall/lib/marshall_web/browser_messages.ex:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall_web/browser_messages.ex:29\u0060 calls \u0060dgettext\u0060 and \u0060marshall/lib/marshall_web/browser_messages.ex:86\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":"marshall/lib/marshall_web/browser_messages.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0af364d547db6b01f8f6ee922ff5958baf424deaee1e577b3c546d9369f9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lilly/lib/lilly/transfer/clone_copy_journal.ex:172-184 | lilly/lib/lilly/transfer/import_journal.ex:117-129 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex\u0060 and \u0060lilly/lib/lilly/transfer/import_journal.ex\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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce3a43805e3b9453ccb26d2d0fb160b4b7245d0d4092bda3c866134bdc18ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lilly/scripts/smoke_guest.exs:155-165 | lilly/scripts/smoke_jailed.exs:469-479 \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":"lilly/scripts/smoke_guest.exs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ea76dbcc85f36f34a85e715e8ee54606a4b50615d2d2f645c9c227b91e44ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): marshall/lib/marshall/agents/thread_delivery.ex:53-63 | marshall/lib/marshall/agents/thread_delivery.ex:91-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/agents/thread_delivery.ex:53\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":"marshall/lib/marshall/agents/thread_delivery.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9310e8c6afa46a7694a754106314ed8d93bbf57c04eb682f8681d4df50112276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): marshall/lib/marshall/compute/relocation_cancellation.ex:13-23 | marshall/lib/marshall/compute/relocation_retry_admission.ex:20-30 \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 \u0060marshall/lib/marshall/compute/relocation_cancellation.ex: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_cancellation.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"29af1e9767ea0138d7a6040a7129722f186d3371705416eedd6621ab338d5b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): marshall/lib/marshall/galileo/configurations.ex:456-466 | marshall/lib/marshall/teams/coordinator.ex:623-633 \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":"marshall/lib/marshall/galileo/configurations.ex"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"013741862e182ba1da4ec50bc792b525ae0f52a0a177d56f6761ea2295b1dd0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): porsche/lib/porsche/ssh/onboarding.ex:28-38 | protocol/lib/overalls_protocol/ssh_onboarding.ex:27-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060porsche/lib/porsche/ssh/onboarding.ex:28\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":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"30df50f6140efc74bf7a1f27bfd780b45a19f3db2fb37c4f6349ff40ae32b76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): marshall/lib/marshall/redaction/coordinator.ex:53-62 | marshall/lib/marshall/redaction/coordinator.ex:70-78 | marshall/lib/marshall/redaction/coordinator.ex:148-156 | marshall/lib/marshall/redaction/coordinator.ex:163-171 \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 \u0060marshall/lib/marshall/redaction/coordinator.ex:53\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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"92112841f3fab12810654a655518fa35336e886b45604ea890400a8b3acc2b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): audi/lib/audi/privacy.ex:40-49 | porsche/lib/porsche/privacy.ex:37-46 | ziggy/lib/ziggy/privacy.ex:35-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/privacy.ex:40\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":"audi/lib/audi/privacy.ex"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1339d96aade4155ca8aeb2b32b59628f9642bacd55038ef4844e0d3df3af72d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lilly/lib/lilly/ingress/server.ex:307-316 | lilly/lib/lilly/network/attribution_server.ex:135-144 | lilly/lib/lilly/private/server.ex:135-144 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abb4de223de102c5ca7b3f05f368f12fe4949c54f61a34e14fa92fab5e0bbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): audi/lib/audi/control/client.ex:348-357 | audi/lib/audi/control/client.ex:417-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264bf90ddb8131c16b5b9d1d232acb24dd0b035f4d519dc56fc207e92e01396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): audi/lib/audi/http/browser.ex:116-125 | audi/lib/audi/http/editor_browser.ex:116-125 \u2014 before extracting anything, compare \u0060audi/lib/audi/http/browser.ex\u0060 and \u0060audi/lib/audi/http/editor_browser.ex\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18dac9abd2f932cd7cf3d98fbc065784091df6cad145b138c3ed46b644fac92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lilly/lib/lilly/transfer/permit_journal.ex:200-208 | lilly/lib/lilly/transfer/permit_journal.ex:227-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":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e1fc9e0794154ff1cc14af017e1f50831e5f94dd4e0c6d0239e5de782441a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/access/sharing.ex:67-76 | marshall/lib/marshall/threads/sharing.ex:63-72 \u2014 \u0060marshall/lib/marshall/access/sharing.ex\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/access/sharing.ex:67\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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e014dce15cdb3e23b5e195cc74ec6d65cbaabc1038e7c2d60b2f4000bff58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/accounts/scim_retirement.ex:90-99 | marshall/lib/marshall/accounts/scim_retirement.ex:222-231 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/accounts/scim_retirement.ex:90\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":"marshall/lib/marshall/accounts/scim_retirement.ex"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c71f60b2e068b53be3bd438f7e2b1796d6c2e244bd3b2d5b4956cbf7e0004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/compute/relocation_coordinator.ex:258-267 | marshall/lib/marshall/compute/relocation_coordinator.ex:279-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b80fe8297731c4c9c7183f27f266d58556eed04b26e5c75e88628c61e9002f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/editor/retention.ex:32-41 | marshall/lib/marshall/ingress/web_retention.ex:37-46 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060marshall/lib/marshall/editor/retention.ex:30\u0060 calls \u0060purge\u0060, \u0060module\u0060, \u0060t\u0060 and \u0060marshall/lib/marshall/ingress/web_retention.ex:34\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":"marshall/lib/marshall/editor/retention.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"df06b70e1c151e62f0b37bd53915a6cf865ea43c7a679f990ae1b6fd53afe9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/galileo/credentials.ex:93-102 | marshall/lib/marshall/peach/credentials.ex:93-102 \u2014 \u0060marshall/lib/marshall/galileo/credentials.ex\u0060 and \u0060marshall/lib/marshall/peach/credentials.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e6b9119234380ffe03c6aa263c8e7696ec9b4970a5f4f4d1959496b603c07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall/ingress/execution.ex:60-69 | marshall/lib/marshall/ssh/guest_access.ex:335-344 \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. 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":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddb407eb6e322fc67292630bfb2fd454d6046cf525c91142dddcaa3955ca7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): marshall/lib/marshall_web/components/layouts.ex:400-409 | marshall/lib/marshall_web/components/layouts.ex: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/components/layouts.ex:400\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":"marshall/lib/marshall_web/components/layouts.ex"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cbda7fbed8e3334c005e15da6fc88ea415f9961443147b47b2d3244cefa039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 7): marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25-32 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:18-26 | marshall/lib/marshall/compute/relocation_imports.ex:29-36 | marshall/lib/marshall/compute/relocation_keys.ex:20-27 | marshall/lib/marshall/compute/relocation_readiness.ex:29-36 | marshall/lib/marshall/compute/relocation_revocations.ex:18-26 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:18-25 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\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. If that is what happened, the fix is to keep one copy and have the other 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 \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25\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":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"566ea898e1f53429373a8d1387069087574ffbe34af788fbdad639a86d255c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): antithesis/control_peer/runner.exs:92-100 | antithesis/control_peer/runner.exs:157-165 | antithesis/control_peer/runner.exs:203-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":"antithesis/control_peer/runner.exs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"777f0f2a5bac0124e3389dab77a34c1ec84bf7e2c0fae93ae61f00949389297d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:89-97 | lilly/lib/lilly/control/store.ex:158-166 | lilly/lib/lilly/host/ownership.ex:121-129 \u2014 before extracting anything, compare \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex\u0060 and \u0060lilly/lib/lilly/host/ownership.ex\u0060 as WHOLE FILES: this scan already matched 4 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":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7069faed40011b55a4b4c65fd55080fe6a197a426609eba27910bac88764274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): antithesis/control_peer/runner.exs:152-159 | antithesis/control_peer/runner.exs:190-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060antithesis/control_peer/runner.exs:188\u0060 calls \u0060barrier\u0060 and \u0060antithesis/control_peer/runner.exs:151\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":"antithesis/control_peer/runner.exs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"665505805268a3f113e16e095db2955721dea7a022a3053a693893fbcf2985e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:54-62 | lilly/lib/lilly/host/ownership.ex:62-70 \u2014 before extracting anything, compare \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex\u0060 and \u0060lilly/lib/lilly/host/ownership.ex\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:54\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, \u0060lilly/lib/lilly/host/ownership.ex:61\u0060 calls \u0060run\u0060 and \u0060antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex:53\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":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa79595658917ae06a54e2b67adc21659e6008059a9363cfe56613e6f11aab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): audi/lib/audi/slo.ex:86-94 | marshall/lib/marshall/slo.ex:130-138 \u2014 before extracting anything, compare \u0060audi/lib/audi/slo.ex\u0060 and \u0060marshall/lib/marshall/slo.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/slo.ex:86\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":"audi/lib/audi/slo.ex"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f52871ba2e28ca47c17651d512d09ce2afbdbc361ea5b7a33f110ba43266925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:132-146 | marshall/lib/marshall/ingress/acme/material.ex:132-146 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b8948dfe7c3558631bbfba65ab572e615443ee2c64f4fb83d85f14f8c2ebfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): galileo/lib/galileo/http.ex:30-38 | ziggy/lib/ziggy/http.ex:32-40 \u2014 before extracting anything, compare \u0060galileo/lib/galileo/http.ex\u0060 and \u0060ziggy/lib/ziggy/http.ex\u0060 as WHOLE FILES: this scan already matched 4 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":"galileo/lib/galileo/http.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67c5e73b3ab94d33a360152e8602a31194a0e8292db45ecf08ec8e0f961fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/ingress/server.ex:18-26 | lilly/lib/lilly/private/server.ex:11-19 \u2014 \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/private/server.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"481996fcbb935187961dc59957058d18f43344651ab85d86ee65ec81024fbaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/ingress/server.ex:41-49 | lilly/lib/lilly/private/server.ex:34-42 \u2014 \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/private/server.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 106 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/ingress/server.ex:41\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, \u0060lilly/lib/lilly/ingress/server.ex:40\u0060 calls \u0060maximum\u0060 and \u0060lilly/lib/lilly/private/server.ex:33\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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd38a0f846b6fe53baab3d6df0e0fef1dd3b55a090cb90a1d8307b9a3ce2e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/vm/disk.ex:325-333 | lilly/lib/lilly/vm/disk.ex: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/disk.ex"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0bdf7afcd1caa0ebeba3a8e579715a2fd42e285991f4006135f5bfdddf2c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/vm/driver.ex:486-494 | lilly/lib/lilly/vm/driver.ex:576-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e6ad2fcbd228f057b10768d4fe7ffbe35c5eb8902f8ea5891852e9bf0bcd54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): marshall/lib/marshall/compute/evacuation_views.ex:121-129 | marshall/lib/marshall/compute/evacuation_views.ex:207-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/evacuation_views.ex"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"044e59f8680165bb99a2230c9d8b61fb490178e6efa63bf4a25f91a75774525a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): marshall/lib/marshall/galileo/authorizations.ex:191-199 | marshall/lib/marshall/inference/requests.ex:195-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/galileo/authorizations.ex:191\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":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b1484949cc087f4e17722223192de81382c7999b5131491819ef8cc9c5f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): marshall/lib/marshall/ingress/catalog.ex:38-46 | marshall/lib/marshall/ingress/editor_assets.ex:21-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. 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":"marshall/lib/marshall/ingress/catalog.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"863b4714829d6feab3666c8c5c80ba33c4fbab34d9d0efdb4db9d86fac9d4600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): marshall/lib/marshall/redaction/coordinator.ex:64-72 | marshall/lib/marshall/redaction/coordinator.ex:81-89 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/redaction/coordinator.ex:64\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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaed45b3b08e2d6cfeabccc03fab8f9ef73cb67b2ab1f9c8255c08b0f77167dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): marshall/lib/marshall/redaction/coordinator.ex:168-176 | marshall/lib/marshall/redaction/coordinator.ex:181-189 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/redaction/coordinator.ex:168\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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f44bbf3e6955124b28ad6f9640a1b8e24b9a38cee5b6e871500a48eb8e6f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ziggy/lib/ziggy/agent_worker.ex:199-207 | ziggy/lib/ziggy/http.ex:582-590 \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 \u0060ziggy/lib/ziggy/agent_worker.ex:199\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":"ziggy/lib/ziggy/agent_worker.ex"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e04d25a4eb4dd3e03b888fc77be809f991eebdb11ff59ad75e3c28bb0e9fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25-32 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:18-25 | marshall/lib/marshall/compute/relocation_imports.ex:29-36 | marshall/lib/marshall/compute/relocation_keys.ex:20-27 | marshall/lib/marshall/compute/relocation_probes.ex:30-37 | marshall/lib/marshall/compute/relocation_readiness.ex:29-36 | marshall/lib/marshall/compute/relocation_revocations.ex:18-25 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:18-25 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\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. If that is what happened, the fix is to keep one copy and have the other 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 \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex:25\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":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c555827f0e8f8284fa43dbaef21a5ded371d42feab1457f2b15eb24725b7488d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 6): lilly/lib/lilly/vm/credentials.ex:109-114 | lilly/lib/lilly/vm/flush.ex:21-26 | lilly/lib/lilly/vm/guest_trust.ex:69-74 | lilly/lib/lilly/vm/inception_exchange.ex:79-84 | lilly/lib/lilly/vm/kernel_attestation.ex:84-91 | lilly/lib/lilly/vm/readiness.ex:70-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 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/vm/credentials.ex:109\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lilly/lib/lilly/vm/credentials.ex:116\u0060 calls \u0060setopts\u0060, \u0060remaining\u0060, \u0060send\u0060 and \u0060lilly/lib/lilly/vm/readiness.ex:77\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":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe35aa5867afa10436ed0e9a5b3ef4a77663cb20c8c78d665b85bdc86a66223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:29-36 | lilly/lib/lilly/host/mount_table.ex:45-52 | marshall/lib/marshall/compute/enrollment_request.ex:70-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex:29\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":"antithesis/lilly/lib/overalls_antithesis/lilly/pool_config.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"315e08be3ebbb8c1bf948f3ffd41bd624ecb7444a45dd58bb693f9c7f87ea537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): enrico/scripts/invalid_boot_probe.exs:11-17 | galileo/scripts/invalid_boot_probe.exs:11-17 | ziggy/scripts/invalid_boot_probe.exs:11-18 \u2014 before extracting anything, compare \u0060enrico/scripts/invalid_boot_probe.exs\u0060 and \u0060galileo/scripts/invalid_boot_probe.exs\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":"enrico/scripts/invalid_boot_probe.exs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d109512afbfaf5d61f9936416843fee8c6934d453c67cb2c6ba138072c97600d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): lilly/lib/lilly/ingress/server.ex:21-39 | lilly/lib/lilly/network/attribution_server.ex:15-33 | lilly/lib/lilly/private/server.ex:14-32 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lilly/lib/lilly/ingress/server.ex:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lilly/lib/lilly/ingress/server.ex:40\u0060 calls \u0060maximum\u0060 and \u0060lilly/lib/lilly/private/server.ex:33\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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e3848b0183ffcac163fbf0b1e68c6812a648136988b3121b0f0a60eb347be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lilly/lib/lilly/transfer/checkpoint_transfer.ex:279-286 | lilly/lib/lilly/vm/checkpoint_storage.ex:380-387 | lilly/lib/lilly/vm/checkpoint_storage.ex:647-654 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/transfer/checkpoint_transfer.ex:279\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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da3e3663e5d686e6d4e33279883d05b20d98acb4294828e54d9adf8eb4868ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): marshall/lib/marshall_web/browser_messages.ex:31-38 | marshall/lib/marshall_web/browser_messages.ex:44-62 | marshall/lib/marshall_web/browser_messages.ex:67-77 \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 \u0060marshall/lib/marshall_web/browser_messages.ex:44\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, \u0060marshall/lib/marshall_web/browser_messages.ex:30\u0060 calls \u0060dgettext\u0060 and \u0060marshall/lib/marshall_web/browser_messages.ex:66\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":"marshall/lib/marshall_web/browser_messages.ex"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8232374e4157ee4f2879da07d85cf1dbcdd8c8664cc8cd618ac687f6ae758e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/windows-dotnet/Interop/RustNative.cs:337-343 | mila/windows-dotnet/Interop/RustNative.cs:432-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/RustNative.cs:337\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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5223c749a623e8250b403d81e490fb2aaa967b1fc8f0f8767c2b212f85e62c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/lib/lilly/host/zfs_dataset.ex:1302-1311 | lilly/lib/lilly/vm/checkpoint_storage.ex:151-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/host/zfs_dataset.ex:1302\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 before the matched lines, \u0060lilly/lib/lilly/vm/checkpoint_storage.ex:150\u0060 calls \u0060to_string\u0060, \u0060checkpoint_bytes\u0060 and \u0060lilly/lib/lilly/host/zfs_dataset.ex:1301\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":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57338bd432317424eb63914ec67361fb10f9b3e29f191295f11d70bb9ba11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/lib/lilly/observability.ex:122-129 | porsche/lib/porsche/observability.ex:260-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/observability.ex:122\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":"lilly/lib/lilly/observability.ex"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d65f7c8654252e3e53b8a82efd4a567658edaf3a2ac1651a870d11e6ceb5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/lib/lilly/transfer/import_journal.ex:143-150 | lilly/lib/lilly/transfer/import_journal.ex:180-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":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf832da18bf8e35e3c38c2876792a89e1a150f600266bb555cbf49a707d7bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/vm/executor.ex:135-143 | lilly/lib/lilly/vm/executor.ex:165-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":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe00ac3fb011b572df715f66bf88c4416e94241824dfe9b2d0f9ff61747d328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/access/sharing.ex:120-127 | marshall/lib/marshall/threads/sharing.ex:119-126 \u2014 \u0060marshall/lib/marshall/access/sharing.ex\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060marshall/lib/marshall/threads/sharing.ex:117\u0060 calls \u0060list\u0060, \u0060t\u0060 and \u0060marshall/lib/marshall/access/sharing.ex:117\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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"26df28a0ef8380d8fd74fe61770d5fc287ce8653d52b3f9908c60b0134cab221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/accounts/account_lifecycle.ex:137-144 | marshall/lib/marshall/accounts/administrators.ex:36-43 \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":"marshall/lib/marshall/accounts/account_lifecycle.ex"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8238e6ad3624950356326470677500d8a04d93ee0d0ca6107126a033d33c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/agents/context_manifest.ex:146-153 | marshall/lib/marshall/agents/context_manifest.ex:191-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/agents/context_manifest.ex:146\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":"marshall/lib/marshall/agents/context_manifest.ex"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e0bdfc66038aca35357c9ebdc7edee8c7dff69cc49819d19f915773374ceb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/ingress/acme/issuer.ex:20-27 | marshall/lib/marshall/ingress/acme/issuer.ex:42-49 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/ingress/acme/issuer.ex:20\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":"marshall/lib/marshall/ingress/acme/issuer.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b3ed98de99c90418172d1a35e7fa81fd1fea6b1204473791dd818f0d56a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/ingress/sessions.ex:108-115 | marshall/lib/marshall/ssh/authority.ex:113-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/sessions.ex"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcdadd8c275c3cd8e8c57dc0c4d60d45ca982493ea74ed4ed4a0e7b6332e8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/ssh/admin_actions.ex:55-62 | marshall/lib/marshall/ssh/admin_actions.ex:120-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/ssh/admin_actions.ex:55\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, \u0060marshall/lib/marshall/ssh/admin_actions.ex:54\u0060 calls \u0060for_read\u0060 and \u0060marshall/lib/marshall/ssh/admin_actions.ex:119\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":"marshall/lib/marshall/ssh/admin_actions.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7d006f8ced058ca13fabab979b75521514979f6aacaf2686a131f643fdf05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall_web/live/account_live.ex:447-454 | marshall/lib/marshall_web/live/integrations_live.ex:179-189 \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":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a042626901ad426b91e674a6371046319e93d5c1d4a8f79c143c4b1ed0337589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): protocol/lib/overalls_protocol/editor_stream.ex:35-42 | protocol/lib/overalls_protocol/web_stream.ex:41-48 \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":"protocol/lib/overalls_protocol/editor_stream.ex"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8bb792adb7c5f1685f5a8a39a2606599106898664cddd053f31e047f8314d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): marshall/lib/marshall/compute/relocation_cleanup.ex:136-142 | marshall/lib/marshall/compute/relocation_destination_cleanups.ex:24-30 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:17-23 | marshall/lib/marshall/compute/relocation_imports.ex:28-34 | marshall/lib/marshall/compute/relocation_key_retirement.ex:16-22 | marshall/lib/marshall/compute/relocation_keys.ex:19-25 | marshall/lib/marshall/compute/relocation_probes.ex:29-35 | marshall/lib/marshall/compute/relocation_readiness.ex:28-34 | marshall/lib/marshall/compute/relocation_revocations.ex:17-23 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:17-23 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae03e76fcfb6a8a3b8870758f895e101a499a14274dcc04ce395f4f32c5b9cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mila/windows-dotnet/Interop/RustNative.cs:807-813 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:186-192 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:423-429 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/RustNative.cs:807\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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b899eef4f0dd91208d6338f30d2f55f9fbfcf40fd8a473bbdc0cfd5f8e2660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lilly/lib/lilly/transfer/clone_copy_journal.ex:168-174 | lilly/lib/lilly/transfer/import_journal.ex:113-119 | lilly/lib/lilly/transfer/snapshot_journal.ex:167-173 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex\u0060 and \u0060lilly/lib/lilly/transfer/import_journal.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex:168\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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8cd6e3a21cbb71d8c7e6343f78874b6f27f59960e8534f9a58471f5f1747d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): marshall/lib/marshall/galileo/credentials.ex:131-139 | marshall/lib/marshall/inference/credentials.ex:205-213 | marshall/lib/marshall/peach/credentials.ex:131-139 \u2014 \u0060marshall/lib/marshall/galileo/credentials.ex\u0060 and \u0060marshall/lib/marshall/peach/credentials.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/galileo/credentials.ex:131\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":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a726e77dabb872432d06e3f67de188f31c597b4e7524fb74611d191e032bb881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): mila/windows-dotnet/Interop/RustNative.cs:465-471 | mila/windows-dotnet/Interop/RustNative.cs:488-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/RustNative.cs:465\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67b7d14419f176578f58a757e6b27fa64dda033158c28a21a5df1ad09df7241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:82-91 | marshall/lib/marshall/ingress/acme/material.ex:82-91 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060audi/lib/audi/tls/fleet_material.ex:82\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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfec1916688ccc76560685d76dad0cb88d25d5edd143410fdcbad564dd206307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): lilly/lib/lilly/host/zfs.ex:460-463 | lilly/lib/lilly/host/zfs.ex:482-488 | lilly/lib/lilly/host/zfs.ex:510-516 \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 \u0060lilly/lib/lilly/host/zfs.ex:482\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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e6e9807fd48cb63d5b70a701217295c5ac4f375e7d73b1d76e74dc9f7f308b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lilly/lib/lilly/terminal/vsock.ex:192-198 | lilly/lib/lilly/terminal/vsock.ex:264-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/vsock.ex"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2541d08a4813f8037279374ba9482355e3eef72880e106398105f03c27903941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): lilly/lib/lilly/transfer/key.ex:161-167 | lilly/lib/lilly/vm/checkpoint_storage.ex:272-277 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/transfer/key.ex:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39e0fdbc448f342a76aa8ba968b5a247863cc2ac731420def1fa78a698b4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lilly/lib/lilly/transfer/key_runtime.ex:81-87 | lilly/lib/lilly/transfer/source_runtime.ex:105-111 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/key_runtime.ex\u0060 and \u0060lilly/lib/lilly/transfer/source_runtime.ex\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":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5b00b9ec3ad157f5d1e01012b46622e7d7165c768d8d5ae70711c31f5013c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): marshall/lib/marshall/access/admin_actions.ex:39-43 | marshall/lib/marshall/ssh/admin_actions.ex:46-52 | marshall/lib/marshall/ssh/admin_actions.ex:103-106 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note 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, \u0060marshall/lib/marshall/ssh/admin_actions.ex:106\u0060 calls \u0060compute\u0060 and \u0060marshall/lib/marshall/ssh/admin_actions.ex:52\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":"marshall/lib/marshall/access/admin_actions.ex"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69d0220860d5e0ad444a26db09edf57b3ea5c7bf879636d8ad29a898dca6780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/access/sharing.ex:56-62 | marshall/lib/marshall/teams/coordinator.ex:126-132 \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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5b81e12227565a1899c7faeda030303ea065490c4509d71ca6a75f273c66d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/compute/clone_placement.ex:66-72 | marshall/lib/marshall/compute/resize.ex:136-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_placement.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1f2deaac6df4a46208ca617cd789b03b204f7340e6fd8c1486578415f3b85e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): marshall/lib/marshall/compute/relocation_cleanup.ex:119-125 | marshall/lib/marshall/compute/relocation_deletion.ex:135-140 \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":"marshall/lib/marshall/compute/relocation_cleanup.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea58e63181d2ff7012ed7e70aea8cd506dea62217262d45cdd337f43c2573ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/compute/relocation_destination_cleanups.ex:53-59 | marshall/lib/marshall/compute/relocation_destination_revocations.ex:47-53 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_destination_cleanups.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_destination_revocations.ex\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c4d34d62eccac3d34f29f6b03393c3add0a433f213f4dca68f44a223c2ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/compute/relocation_revocations.ex:47-53 | marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex:48-54 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/compute/relocation_revocations.ex\u0060 and \u0060marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_revocations.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab605e05cb1d85ca70368be2a9905dc8c574d8aace930863603eb3a353206f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/ingress/retention.ex:15-21 | marshall/lib/marshall/ssh/retention.ex:16-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/ingress/retention.ex:15\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":"marshall/lib/marshall/ingress/retention.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc581df4399648f0114872c7389e27a19dfd203abe8507ec560b84131c05750f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/operations/galileo.ex:16-22 | marshall/lib/marshall/operations/peach.ex:16-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/operations/galileo.ex:16\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":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb35b16fc5090d1a8d515b42478fd46133ef37ad89d7cf57ddb0eb440284068e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/redaction/coordinator.ex:87-93 | marshall/lib/marshall/redaction/coordinator.ex: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/redaction/coordinator.ex:87\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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e7e01442e4503f0115be7cbd73b8f4b0d893a9752e6022712e218dcc8380e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/ssh/authority.ex:183-189 | marshall/lib/marshall/ssh/authority.ex:198-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":"marshall/lib/marshall/ssh/authority.ex"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab77983ea5bbe0fd6862d15fbed461fb0e0cb29b5ba95aa85b6aba8d7655a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): marshall/lib/marshall/ssh/host_certificate_retention.ex:24-28 | marshall/lib/marshall/terminal/ticket_retention.ex:26-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/ssh/host_certificate_retention.ex:24\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":"marshall/lib/marshall/ssh/host_certificate_retention.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278c5394210fef3668681b604732718e59a944ad9ea37797bd7b1c2baa00ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall_web/admin_elevation.ex:49-55 | marshall/lib/marshall_web/browser_messages.ex:83-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/admin_elevation.ex:49\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":"marshall/lib/marshall_web/admin_elevation.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"23da02cf65392e24b3355bbdcbf7fff2791b581833e04ec5549bbfef31a5bb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): porsche/lib/porsche/ssh/onboarding.ex:159-169 | protocol/lib/overalls_protocol/ssh_onboarding.ex:130-140 \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":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db4393674a69c6d2d0317b0b77cce1d7b55a0e3139070373550260ead9604ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): mila/windows-dotnet/Interop/RustNative.cs:308-312 | mila/windows-dotnet/Interop/RustNative.cs:373-377 | mila/windows-dotnet/Interop/RustNative.cs:401-405 | mila/windows-dotnet/Interop/RustNative.cs:550-554 | mila/windows-dotnet/Interop/RustNative.cs:769-773 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/RustNative.cs:308\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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae78a074a472ba4d7cfeb695c1c8e49ad2441d6c4492f7e2eac43c734cbc62de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lilly/lib/lilly/transfer/clone_copy_journal.ex:168-173 | lilly/lib/lilly/transfer/import_journal.ex:113-118 | lilly/lib/lilly/transfer/import_journal.ex:174-179 | lilly/lib/lilly/transfer/snapshot_journal.ex:167-172 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex\u0060 and \u0060lilly/lib/lilly/transfer/import_journal.ex\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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex:168\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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"203a964934da4627c053eea65d9452c470eb403a63cbe559d631df134f7e383f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): galileo/lib/galileo/credential.ex:11-21 | peach/lib/peach/credential.ex:11-21 | ziggy/lib/ziggy/credential.ex:11-21 \u2014 before extracting anything, compare \u0060galileo/lib/galileo/credential.ex\u0060 and \u0060ziggy/lib/ziggy/credential.ex\u0060 as WHOLE FILES: 95% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/credential.ex"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"949a6f8ad2d2d271535dcacad3acac7f13717ebfe6d58d40687daa3e17bdfc48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lilly/lib/lilly/ingress/server.ex:93-100 | lilly/lib/lilly/network/attribution_server.ex:76-83 | lilly/lib/lilly/private/server.ex:73-80 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/ingress/server.ex\u0060 and \u0060lilly/lib/lilly/network/attribution_server.ex\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lilly/lib/lilly/ingress/server.ex:93\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":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12df5e7dcc42b6164fc9656ddd905af27b7c9e3d7fa750849fef18e8f3d97f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): marshall/lib/marshall/operations/galileo.ex:15-20 | marshall/lib/marshall/operations/inference.ex:15-20 | marshall/lib/marshall/operations/peach.ex:15-20 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/operations/galileo.ex:15\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":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6035b050dbef8acf00008d27f722b47f3f4116e608e46d9ed6684ad278e536c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): audi/lib/audi/config.ex:114-120 | porsche/lib/porsche/config.ex:26-31 \u2014 before extracting anything, compare \u0060audi/lib/audi/config.ex\u0060 and \u0060porsche/lib/porsche/config.ex\u0060 as WHOLE FILES: this scan already matched 5 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. 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":"audi/lib/audi/config.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b526809c033f0d02016f9bf2d92c9ca0e23d5720c785bd16dfc260b5ea3effc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): audi/lib/audi/config.ex:371-376 | porsche/lib/porsche/config.ex:85-90 \u2014 before extracting anything, compare \u0060audi/lib/audi/config.ex\u0060 and \u0060porsche/lib/porsche/config.ex\u0060 as WHOLE FILES: this scan already matched 5 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":"audi/lib/audi/config.ex"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39824cff57e00b25de41a37d1ee933353e28c4e36ad94edd53c43f92fd385ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:109-120 | marshall/lib/marshall/ingress/acme/material.ex:109-120 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c14b44e1bb326f370b6904dbe864f6d7aba4d4b40a5cd8217bda1f6b525b861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lilly/lib/lilly/inception/propagation.ex:117-122 | marshall/lib/marshall/ingress/acme/propagation.ex:101-106 \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":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"47401e3bfc6f3cf23f7676f2f6d712c44dde7d41539f5be3b92f94b3c0fe465d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lilly/lib/lilly/transfer/checkpoint_transfer.ex:265-270 | lilly/lib/lilly/vm/checkpoint_storage.ex:637-642 \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":"lilly/lib/lilly/transfer/checkpoint_transfer.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee3a051927504494a07c234f5d73a217f72748f109699833f3d1af686dd911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/access/sharing.ex:139-144 | marshall/lib/marshall/threads/sharing.ex:133-139 \u2014 \u0060marshall/lib/marshall/access/sharing.ex\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/access/sharing.ex:139\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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"17559425e62328824d070c1a7297175ad01ea2005a65eae2de69c60c7e5d8db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/agents/conversation.ex:87-92 | marshall/lib/marshall/threads.ex:113-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall/threads.ex:119\u0060 calls \u0060error_reason\u0060 and \u0060marshall/lib/marshall/agents/conversation.ex:93\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":"marshall/lib/marshall/agents/conversation.ex"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ada7cb29028a3180143541432584d53cc834a28dea1b728a97a48c3e70f430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/compute/evacuations.ex:156-161 | marshall/lib/marshall/compute/evacuations.ex:197-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":"marshall/lib/marshall/compute/evacuations.ex"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5986ebb66adc7e9cfde02b0c732a040c41347a499cc255a301d105777cf48f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/compute/lifecycle.ex:425-431 | marshall/lib/marshall/compute/resize.ex:591-597 \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":"marshall/lib/marshall/compute/lifecycle.ex"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad781462f551f76bb09f4d7a0fc8bc7e7db3e656e6108c53556b74d6c1a3709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/compute/relocation_coordinator.ex:291-298 | marshall/lib/marshall/compute/relocation_probes.ex:255-260 \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 \u0060marshall/lib/marshall/compute/relocation_coordinator.ex:291\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":"marshall/lib/marshall/compute/relocation_coordinator.ex"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1100a58a75e3770571ed871c28efd90c5f1df70e4dff01196621cf0b206748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/editor/token.ex:25-30 | marshall/lib/marshall/ssh/token.ex:27-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":"marshall/lib/marshall/editor/token.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b4ed1d5f3be6ce064fe48801ff427670160981ecb09af1c46f3687c13c7f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall_web/admin_elevation.ex:32-37 | marshall/lib/marshall_web/components/layouts.ex:438-443 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/admin_elevation.ex:32\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":"marshall/lib/marshall_web/admin_elevation.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a92117a1ee5146419e136ee7085179d8d44900227ff376db09d1404c185aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): marshall/lib/marshall/operations/private_files.ex:89-90 | porsche/lib/porsche/config.ex:103-108 | susan/lib/susan/credentials.ex:85-90 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note 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, \u0060porsche/lib/porsche/config.ex:103\u0060 calls \u0060uid\u0060 and \u0060marshall/lib/marshall/operations/private_files.ex:89\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":"marshall/lib/marshall/operations/private_files.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f5238c03d10e9e7c2ab56f025105e1a1d99b460b95588506730c3c1828d301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): protocol/lib/overalls_protocol/relocation.ex:57-63 | protocol/lib/overalls_protocol/relocation.ex:84-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b24c662f8f628b8bee2a48472a1e8d34739212959039fb16b7a433c56ec59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ziggy/lib/ziggy/bootstrap_release.ex:37-47 | ziggy/lib/ziggy/tool_release.ex:39-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ziggy/lib/ziggy/bootstrap_release.ex:37\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":"ziggy/lib/ziggy/bootstrap_release.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"849984715c2179c8f6b1fb7eb486c472772501158bbb4e98fb4f11192b23394a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ziggy/lib/ziggy/slo_checkpoint.ex:134-141 | ziggy/lib/ziggy/spool.ex:366-371 \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":"ziggy/lib/ziggy/slo_checkpoint.ex"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e15eb91350ae33b343251e2adf580e9fe7c6923f9590277e8bcd5b87d55fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): mila/windows-dotnet/Interop/RustNative.cs:371-376 | mila/windows-dotnet/Interop/RustNative.cs:399-404 | mila/windows-dotnet/Interop/RustNative.cs:549-553 | mila/windows-dotnet/Interop/RustNative.cs:767-772 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:188-195 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/windows-dotnet/Interop/RustNative.cs:371\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. 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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5d8d17d71be6d2c12dcecbb38b8248928f7927faa5aa8dbcdf29f6c55f84f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): mila/windows-dotnet/Interop/RustNative.cs:466-470 | mila/windows-dotnet/Interop/RustNative.cs:488-492 | mila/windows-dotnet/Interop/RustNative.cs:537-541 \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 \u0060mila/windows-dotnet/Interop/RustNative.cs:466\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. 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":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce36b38477312fe9adf2f921b86bbd4b59a239776b0006948ef655031f7fb646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): audi/lib/audi/config.ex:367-375 | porsche/lib/porsche/config.ex:81-89 | susan/lib/susan/credentials.ex:26-34 \u2014 before extracting anything, compare \u0060audi/lib/audi/config.ex\u0060 and \u0060porsche/lib/porsche/config.ex\u0060 as WHOLE FILES: this scan already matched 5 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":"audi/lib/audi/config.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe4f30100bb935e2f220064274480aaac7ded9c9e4bf92119bea6700556f87c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): marshall/lib/marshall/access/sharing.ex:123-129 | marshall/lib/marshall/compute/views.ex:147-151 | marshall/lib/marshall/threads/sharing.ex:122-126 \u2014 \u0060marshall/lib/marshall/access/sharing.ex\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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, \u0060marshall/lib/marshall/compute/views.ex:153\u0060 calls \u0060filter\u0060 and \u0060marshall/lib/marshall/threads/sharing.ex:128\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":"marshall/lib/marshall/access/sharing.ex"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ab13b9dbb62a7b1d09cad195bab897a61c0bf9864e097d184c987d02249e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 5): marshall/lib/marshall/agents/cli_access.ex:143-146 | marshall/lib/marshall/inference/retention.ex:21-24 | marshall/lib/marshall/inference/retention.ex:46-50 | marshall/lib/marshall/ingress/environment_stream_retention.ex:22-26 | marshall/lib/marshall/ingress/retention.ex:22-26 \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. 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, \u0060marshall/lib/marshall/inference/retention.ex:45\u0060 calls \u0060sort\u0060, \u0060limit\u0060 and \u0060marshall/lib/marshall/agents/cli_access.ex:143\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":"marshall/lib/marshall/agents/cli_access.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e34efdd593c71dc7effb7aa4b6d00c2eba2da4ff93ec50e740cd600096df2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): marshall/lib/marshall/redaction/coordinator.ex:89-93 | marshall/lib/marshall/redaction/coordinator.ex:167-171 | marshall/lib/marshall/redaction/coordinator.ex:180-184 \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":"marshall/lib/marshall/redaction/coordinator.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e4dd0a886cd03e37e41afa4705212f8822275e1c9b21ddcbe03b13bdf6e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): marshall/lib/marshall_web/components/layouts.ex:392-397 | marshall/lib/marshall_web/components/layouts.ex:399-403 | marshall/lib/marshall_web/components/layouts.ex: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall_web/components/layouts.ex:392\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":"marshall/lib/marshall_web/components/layouts.ex"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"310f7b2cb2acb29d890365639630fe78c281b495bf2f4f402f09e4b7738420e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mila/windows-dotnet/Interop/PokeKeyStore.cs:64-72 | mila/windows-dotnet/Interop/SnapshotStore.cs:55-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":"mila/windows-dotnet/Interop/PokeKeyStore.cs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"57520458266051693de08b8d2ca94804874fef54f8a853ce7365994e2d427037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mila/windows-dotnet/Interop/RustNative.cs:606-610 | mila/windows-dotnet/Interop/RustNative.cs:626-630 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/windows-dotnet/Interop/RustNative.cs:606\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ffb2c971ade525f5ad28fe69a5ee5c8a72389185c29eb211128a9ab819067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mila/windows-dotnet/Interop/RustNativeLifecycle.cs:244-248 | mila/windows-dotnet/Interop/RustNativeLifecycle.cs:352-356 \u2014 both copies are in the same file, so extract the block 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, \u0060mila/windows-dotnet/Interop/RustNativeLifecycle.cs:357\u0060 calls \u0060Alloc\u0060 and \u0060mila/windows-dotnet/Interop/RustNativeLifecycle.cs:249\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":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c3f3f69264c3ff9f8ae301c45f2a7da58629729820ad9db4d66b2a2fafed2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/host/hostd.ex:416-420 | lilly/lib/lilly/host/hostd.ex:476-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/host/hostd.ex:416\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":"lilly/lib/lilly/host/hostd.ex"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec99bcb691975c531a9c6778a93d9f8d3c724a12f32c2a61bc9c00d8654b68ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/transfer/permit_journal.ex:89-93 | lilly/lib/lilly/transfer/permit_journal.ex:185-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":"lilly/lib/lilly/transfer/permit_journal.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4690cc479d3ad8573c29aca6d1588c6762e1484b480fec5f13e5fe273695f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/agents/executor_session.ex:69-73 | marshall/lib/marshall/agents/executor_session.ex:646-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33ddcc646569f7c0b5449ad7f035add2c7325f9a741a3b91453e89d2483af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/compute/evacuation_views.ex:176-183 | marshall/lib/marshall/compute/evacuation_views.ex:220-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/compute/evacuation_views.ex:176\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":"marshall/lib/marshall/compute/evacuation_views.ex"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e54a668486cedb0b121baeb76faea6eaa9131dfc29044f5ca882dde8a3c4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marshall/lib/marshall/compute/service_levels.ex:69-75 | marshall/lib/marshall/compute/workflow_service_levels.ex:144-150 \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 \u0060marshall/lib/marshall/compute/service_levels.ex:69\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":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e219f4f5b2e2409fc35b25c7094605b5b243b0c1455be3a2d5dd6f6659c64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/ssh/guest_access.ex:22-26 | marshall/lib/marshall/ssh/guest_access.ex:63-67 \u2014 both copies are in the same file, so extract the block 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 \u0060marshall/lib/marshall/ssh/guest_access.ex:22\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":"marshall/lib/marshall/ssh/guest_access.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"14003c91875683979471151bfc9e5482b3f90ff2afecd584e89bd26737313130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): protocol/lib/overalls_protocol.ex:265-270 | protocol/lib/overalls_protocol/execution.ex:446-451 \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":"protocol/lib/overalls_protocol.ex"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199125674718ac2f820e8f34acc0a37ec791e7e85c1fabae570a199c5a3dfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): enrico/lib/enrico/slo.ex:9-21 | porsche/lib/porsche/slo.ex:9-25 \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":"enrico/lib/enrico/slo.ex"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"52061297aff9cae8323a2a2c31e957e3f6253f8432fe2041cea2b5acecad6918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): marshall/lib/marshall_web/gettext_plural.ex:14-34 | porsche/lib/porsche/gettext_plural.ex:14-34 \u2014 before extracting anything, compare \u0060marshall/lib/marshall_web/gettext_plural.ex\u0060 and \u0060porsche/lib/porsche/gettext_plural.ex\u0060 as WHOLE FILES: 96% 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/gettext_plural.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aaa62cfbcd5fe769de63374ed2cc0aae2769cb8626513650e0ad43e46f15a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): audi/lib/audi/control/client.ex:884-890 | audi/lib/audi/dns/challenge.ex:62-68 | porsche/lib/porsche/client.ex:201-207 | protocol/lib/overalls_protocol/inception_exchange.ex:128-134 | protocol/lib/overalls_protocol/inception_observation.ex:33-39 | protocol/lib/overalls_protocol/ingress_relay.ex:63-69 | protocol/lib/overalls_protocol/web_login.ex:56-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/control/client.ex:884\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, \u0060protocol/lib/overalls_protocol/web_login.ex:52\u0060 calls \u0060response\u0060, \u0060term\u0060, \u0060boolean\u0060 and \u0060audi/lib/audi/dns/challenge.ex:59\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":"audi/lib/audi/control/client.ex"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb9eccf3c5240fa33334da4a8ea473ebc6efd82cea73ea89298280d0007d0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): audi/lib/audi/http/authority.ex:78-87 | audi/lib/audi/http/editor.ex:105-114 | audi/lib/audi/http/editor.ex:120-129 \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":"audi/lib/audi/http/authority.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa05d6b8cff8c1282ba1c9684c183ebcc41e379b44ed258ecf071f1f857ddb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): audi/lib/audi/http/editor_assets_probe.ex:140-152 | audi/lib/audi/tls/probe.ex:67-79 \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":"audi/lib/audi/http/editor_assets_probe.ex"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8586bc4591b4d7c5e3599f617e9f2c45320f8a847244319eed503ec16d73b709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): audi/lib/audi/privacy.ex:112-120 | porsche/lib/porsche/privacy.ex:82-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/privacy.ex:112\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":"audi/lib/audi/privacy.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e8c3bf77a0ca6f91cc874dfa47b0a193a1fef826e24bfb9899e55cbaf0e9c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:124-128 | marshall/lib/marshall/ingress/acme/material.ex:124-128 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060audi/lib/audi/tls/fleet_material.ex:124\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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c81c340a26ddf17242ba56d7b0c0eef8dbcb6cbc3be0698660b98e10f33a064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): brady/lib/brady/log.ex:165-175 | marshall/lib/marshall_web/observed_router.ex:25-35 \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":"brady/lib/brady/log.ex"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fdbcd739401baae357d370f5c58b3c4f2d9da0bcbaa6698ca6ea58ae899f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): galileo/lib/galileo/http.ex:293-300 | ziggy/lib/ziggy/http.ex:599-606 \u2014 before extracting anything, compare \u0060galileo/lib/galileo/http.ex\u0060 and \u0060ziggy/lib/ziggy/http.ex\u0060 as WHOLE FILES: this scan already matched 4 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":"galileo/lib/galileo/http.ex"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc269999dd3d09af5d7db6b2338e09ed063c2b145f598fac2a3d31bccc6be41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): galileo/lib/galileo/http.ex:304-311 | ziggy/lib/ziggy/http.ex:610-617 \u2014 before extracting anything, compare \u0060galileo/lib/galileo/http.ex\u0060 and \u0060ziggy/lib/ziggy/http.ex\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060galileo/lib/galileo/http.ex:304\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":"galileo/lib/galileo/http.ex"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"896c854a3123dfeea02acfbbd6d0dfbd65f96baf67ae12794bdb3ae0c6bbaacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): galileo/lib/galileo/http.ex:319-324 | ziggy/lib/ziggy/http.ex:625-630 \u2014 before extracting anything, compare \u0060galileo/lib/galileo/http.ex\u0060 and \u0060ziggy/lib/ziggy/http.ex\u0060 as WHOLE FILES: this scan already matched 4 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":"galileo/lib/galileo/http.ex"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ba3c9f62cd34bd5a2b16dd1aeed6d4e8fcd1564ea3f327ecb94b87cf6bc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lilly/lib/lilly/clone/effects.ex:522-527 | lilly/lib/lilly/transfer/clone_copy.ex:478-486 \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":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ab6346631685485c2e4f82de42f6d9ba68a1e37a3b371c2898d860f094d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/observability.ex:23-27 | marshall/lib/marshall/observability.ex:43-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":"lilly/lib/lilly/observability.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a9cf0b210e3af0287dc027a6e3f68d3cac1796a20a3b6a03db3446bba31640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lilly/lib/lilly/observability.ex:140-147 | marshall/lib/marshall/observability.ex:402-409 | porsche/lib/porsche/observability.ex:320-327 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/observability.ex:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/observability.ex"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa52b4ff1adde0c980a3f0c02f56e0ae08c78c08627cfd22407714cf0799a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lilly/lib/lilly/transfer/clone_copy_journal.ex:142-148 | lilly/lib/lilly/transfer/import_journal.ex:84-90 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex\u0060 and \u0060lilly/lib/lilly/transfer/import_journal.ex\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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42245517401ede82047caeaf251a744db6fc64f24f90b620d9b45a574bc4053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/transfer/clone_copy_journal.ex:247-251 | lilly/lib/lilly/transfer/import_journal.ex:288-292 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex\u0060 and \u0060lilly/lib/lilly/transfer/import_journal.ex\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lilly/lib/lilly/transfer/import_journal.ex:295\u0060 calls \u0060encoded_stream\u0060, \u0060encode_descriptor\u0060 and \u0060lilly/lib/lilly/transfer/clone_copy_journal.ex:254\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":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5065e69648ff726cdf16ad0e532486001e3750cd67a58dbe684cd6849c9e877f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/lib/lilly/transfer/destination_cleanup.ex:104-111 | lilly/lib/lilly/transfer/destination_revocation.ex:35-42 \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":"lilly/lib/lilly/transfer/destination_cleanup.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7312c472bb9ff6021c726a1fac1058e00f6aa336dcdc5b50438d6c6d939be354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lilly/lib/lilly/transfer/source_revocation.ex:29-34 | lilly/lib/lilly/transfer/source_snapshot_cleanup.ex:75-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/source_revocation.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f900342f617ce44858b1103ed0c59e72cd120c1d192dcfbe6d8da9b18d1ea44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lilly/lib/lilly/vm/credentials.ex:147-157 | lilly/lib/lilly/vm/workspace_source.ex:296-306 \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":"lilly/lib/lilly/vm/credentials.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc84a250621894841ab608ebd2aeab41ee08e1fc5d60906c2b64475e45df77a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): marshall/lib/marshall/agents/executor_session.ex:689-697 | marshall/lib/marshall/agents/prompt.ex:264-272 \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":"marshall/lib/marshall/agents/executor_session.ex"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efec41b75acfcc707f52d389cf30cd3d31f727eb49f04d9a2c32967ec5fc2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): marshall/lib/marshall/agents/model_calls.ex:816-829 | marshall/lib/marshall/agents/turn_coordinator.ex:106-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c303c230e888672fa345159cbfa8f73dc226772c5b1132607c3d80bdfbcfc57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): marshall/lib/marshall/editor/token.ex:13-17 | marshall/lib/marshall/ingress/token.ex:23-27 | marshall/lib/marshall/ssh/token.ex:11-15 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall/ingress/token.ex:35\u0060 calls \u0060digest\u0060 and \u0060marshall/lib/marshall/editor/token.ex:21\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":"marshall/lib/marshall/editor/token.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc10a68c1fec535dea489269c8f0d6887879874275175d519dfcbcab459abfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/galileo/credentials.ex:120-127 | marshall/lib/marshall/peach/credentials.ex:120-127 \u2014 \u0060marshall/lib/marshall/galileo/credentials.ex\u0060 and \u0060marshall/lib/marshall/peach/credentials.ex\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 56 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"112636bc0aa346589fff7c887609991bf208ba1743a0df09e837d6be32d6aef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): marshall/lib/marshall/operations/executor_bootstrap.ex:24-39 | marshall/lib/marshall/operations/git_hub_tools.ex:24-39 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/operations/executor_bootstrap.ex\u0060 and \u0060marshall/lib/marshall/operations/git_hub_tools.ex\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"609d34f57b48274a19a6587d20ca6d11ff4d1b25470aada2264b179d69160500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/operations/galileo.ex:58-63 | marshall/lib/marshall/operations/peach.ex:55-60 \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":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20331574faed21adf41f01371056acddf391081b5acaf862af8fcac096d6e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall_web/ingress_api.ex:161-165 | marshall/lib/marshall_web/ssh_api.ex:96-100 \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":"marshall/lib/marshall_web/ingress_api.ex"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9311cc92ca83ad88455368380e6e099138c58a49f31c2d97e6720f98555514da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall_web/live/account_live.ex:421-425 | marshall/lib/marshall_web/live_admin_auth.ex:220-224 \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":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0163c12c2df3993b454d293785ef24a52628cfb378608c5ef7061a678e02f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ziggy/lib/ziggy/bootstrap_release.ex:52-56 | ziggy/lib/ziggy/tool_release.ex:54-58 \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":"ziggy/lib/ziggy/bootstrap_release.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0209d364fdf43dec5bb8d1ebe184ac8a6a02b67a65eaa5935f3a9e7b96fafa53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ziggy/lib/ziggy/slo_checkpoint.ex:175-181 | ziggy/lib/ziggy/spool.ex:457-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/slo_checkpoint.ex"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"502cf8313ba69bbbf427c72fa057096e416a53a11b716bc628d095a08ba5f64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): galileo/lib/galileo/application.ex:34-40 | ziggy/lib/ziggy/application.ex:34-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060galileo/lib/galileo/application.ex:34\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":"galileo/lib/galileo/application.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"664489024bf1f48d87a3c8cea1d903f35c7c6dd29d76816482eae535c4863c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lilly/lib/lilly/terminal/stream.ex:91-96 | protocol/lib/overalls_protocol/control/client.ex:127-132 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060protocol/lib/overalls_protocol/control/client.ex:120\u0060 calls \u0060handle_call\u0060 and \u0060lilly/lib/lilly/terminal/stream.ex:85\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":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04e17a4eaed714653c8bb6199079f9f84c34f84b63e47a4bf0c5595fc1174d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lilly/lib/lilly/transfer/key_runtime.ex:44-57 | lilly/lib/lilly/transfer/source_runtime.ex:59-72 \u2014 before extracting anything, compare \u0060lilly/lib/lilly/transfer/key_runtime.ex\u0060 and \u0060lilly/lib/lilly/transfer/source_runtime.ex\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":"lilly/lib/lilly/transfer/key_runtime.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f66411f7da489739a41a264e08ebf7b6a7cbc45ed5d744411a2f175ac2c3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): marshall/lib/marshall/accounts/administrators.ex:73-79 | marshall/lib/marshall/compute/clone_coordinator.ex:86-92 | marshall/lib/marshall/compute/clone_coordinator.ex:109-115 | marshall/lib/marshall/ingress/sessions.ex:282-288 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marshall/lib/marshall/ingress/sessions.ex:290\u0060 calls \u0060emit_event\u0060, \u0060emit\u0060 and \u0060marshall/lib/marshall/accounts/administrators.ex:81\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":"marshall/lib/marshall/accounts/administrators.ex"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4b796736c16dd6b10732819a5fadb7caf1ec0e77aab07df02f49a82b44c3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): marshall/lib/marshall/compute/probe_dispatch.ex:9-16 | marshall/lib/marshall/compute/relocation_key_dispatch.ex:10-17 | marshall/lib/marshall/compute/source_permit_dispatch.ex:9-16 \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":"marshall/lib/marshall/compute/probe_dispatch.ex"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14cce9e89ffabaa72f56c17aa16ccf9ec848df3bc9b31f9ae05824e1e22216d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marshall/lib/marshall/editor/authority.ex:180-187 | marshall/lib/marshall/ingress/web_streams.ex: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":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b826981067dd22c7e0cae9dd94998b8756b3b7adc8a33590184697ce56719856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/operations/executor_bootstrap.ex:15-19 | marshall/lib/marshall/operations/git_hub_tools.ex:15-19 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/operations/executor_bootstrap.ex\u0060 and \u0060marshall/lib/marshall/operations/git_hub_tools.ex\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other 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 \u0060marshall/lib/marshall/operations/executor_bootstrap.ex:15\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":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"478385fc967abf3de4796a68819107c90d22a3f581ab17fb834ad9433f564cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/operations/inference.ex:57-62 | marshall/lib/marshall/operations/peach.ex:46-51 \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":"marshall/lib/marshall/operations/inference.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c7635c97560556e76cd1251c921bcb259a9b066c618c573211b4216fb224a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): protocol/lib/overalls_protocol/relocation_cleanup.ex:79-85 | protocol/lib/overalls_protocol/relocation_readiness.ex:92-98 | protocol/lib/overalls_protocol/relocation_receive.ex:79-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 all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060protocol/lib/overalls_protocol/relocation_receive.ex:76\u0060 calls \u0060results\u0060, \u0060term\u0060, \u0060result\u0060 and \u0060protocol/lib/overalls_protocol/relocation_cleanup.ex:77\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":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2280da359474548194567ea10083355140b6af2c33f8d9f44aac1c574b34e39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): protocol/lib/overalls_protocol/relocation_cleanup.ex:88-93 | protocol/lib/overalls_protocol/relocation_receive.ex:88-93 \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":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3a3b22438eba6d34565db6e94a49c69c4bb585e12a810b906c37b70261c96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): audi/lib/audi/config.ex:124-133 | porsche/lib/porsche/config.ex:34-43 \u2014 before extracting anything, compare \u0060audi/lib/audi/config.ex\u0060 and \u0060porsche/lib/porsche/config.ex\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/config.ex:124\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":"audi/lib/audi/config.ex"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3badb6f4ff227118db6d3020fecd5703cb982cf912071b6d1a38183ffcf772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): audi/lib/audi/http/browser.ex:48-53 | audi/lib/audi/http/editor_browser.ex:48-53 \u2014 before extracting anything, compare \u0060audi/lib/audi/http/browser.ex\u0060 and \u0060audi/lib/audi/http/editor_browser.ex\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/browser.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44ddfa8f0c8bb5e7541a7ac7c9f3695de8906f4f0287257958f5dfa379fac9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): audi/lib/audi/http/proxy.ex:233-237 | audi/lib/audi/private/front.ex:296-300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060audi/lib/audi/http/proxy.ex:233\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":"audi/lib/audi/http/proxy.ex"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"638735fae9a7a073372b95d3df5453b2f310c76d871035bcddc08eb63c1b433f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): audi/lib/audi/tls/fleet_material.ex:98-103 | marshall/lib/marshall/ingress/acme/material.ex:98-103 \u2014 before extracting anything, compare \u0060audi/lib/audi/tls/fleet_material.ex\u0060 and \u0060marshall/lib/marshall/ingress/acme/material.ex\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"audi/lib/audi/tls/fleet_material.ex"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd7c5b7c50b221319e0c97e971ff149f33c00bc4771431d237fa19ca25fd8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): lilly/lib/lilly/control/client.ex:287-291 | lilly/lib/lilly/control/client.ex:337-341 | lilly/lib/lilly/control/client.ex:387-391 | lilly/lib/lilly/control/client.ex:437-441 | lilly/lib/lilly/control/client.ex:487-491 | lilly/lib/lilly/control/client.ex:535-539 \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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c43a61b0b0e4abfba814fdd808e7a5fe13fe040bfc67eb4aff3faf96d1cb31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): lilly/lib/lilly/control/client.ex:582-587 | lilly/lib/lilly/control/client.ex:638-643 | lilly/lib/lilly/control/client.ex:690-695 | lilly/lib/lilly/control/client.ex:738-743 | lilly/lib/lilly/control/client.ex:788-793 | lilly/lib/lilly/control/client.ex:838-843 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/lib/lilly/control/client.ex:582\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":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5759afcfee65238326d82875124f5a3300913c5b5921c6fdd13e9c5c747482a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/host/zfs.ex:650-654 | lilly/lib/lilly/host/zfs.ex:678-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":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c3329a60e8d65f34a114b15d53922bea1e039eb10bc9e6e10b06f25a712c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/lib/lilly/transfer/received_dataset.ex:259-267 | lilly/lib/lilly/transfer/received_dataset.ex:306-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":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc88b7f62fc41de8c37de1eb0b450dc9ef8665c85476ea4874922dd753edccc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/lib/lilly/vm/checkpoint_storage.ex:484-488 | lilly/lib/lilly/vm/checkpoint_storage.ex:492-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3545c61079f9a887b03925641ac0a1e08066ff146db1dabd0f38e73c4025fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/agents/skills.ex:642-646 | marshall/lib/marshall/threads/sharing.ex:180-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":"marshall/lib/marshall/agents/skills.ex"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a299587228029ddc2a9b7c61f8f6cb42a9e96fb21783791d50983723099ac850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/lib/marshall/compute/service_levels.ex:120-125 | marshall/lib/marshall/compute/workflow_service_levels.ex:273-278 \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. 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":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b70c01478894b0a0b3f9492acf10ebc54aa0179a4524ae1b6e36fd3049a576f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall/operations/executor_bootstrap.ex:44-48 | marshall/lib/marshall/operations/git_hub_tools.ex:44-48 \u2014 before extracting anything, compare \u0060marshall/lib/marshall/operations/executor_bootstrap.ex\u0060 and \u0060marshall/lib/marshall/operations/git_hub_tools.ex\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/executor_bootstrap.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527e17b51706caee37c0fea5ebcbba330847db30a8a27a27d4967ef305d91f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): marshall/lib/marshall/operations/galileo.ex:33-37 | marshall/lib/marshall/operations/inference.ex:45-49 | marshall/lib/marshall/operations/peach.ex:33-37 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/lib/marshall/operations/galileo.ex:33\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":"marshall/lib/marshall/operations/galileo.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2718d570b3723c407833185c16d840adec403fb30106198ad3f1e868ca4931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall_web/ingress_api.ex:59-63 | marshall/lib/marshall_web/ssh_api.ex:44-48 \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":"marshall/lib/marshall_web/ingress_api.ex"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f5a95fbdc1fdaf8a17e8fd7c9aa5b4d512bbc90e972bce3fd88b247b8019ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/lib/marshall_web/terminal_gateway_api.ex:75-79 | marshall/lib/marshall_web/terminal_socket.ex:20-24 \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":"marshall/lib/marshall_web/terminal_gateway_api.ex"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9c8447640540f8ada7e4e631fecc1f1b32cb7d92501a95cacdbed923c2e9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marshall/scripts/locale_catalog_review.exs:28-32 | scripts/localization_catalog_migration.ex: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060marshall/scripts/locale_catalog_review.exs:28\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":"marshall/scripts/locale_catalog_review.exs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22fe33976da28b8ecfc531b5fb0853cd06dd394c29bbbe6d3e05dc1a69da016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ziggy/lib/ziggy/bootstrap_release.ex:13-18 | ziggy/lib/ziggy/tool_release.ex:14-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":"ziggy/lib/ziggy/bootstrap_release.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"363091028ee0bdd48d2af766908e1851193121275b594dd99afd99d421775f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): nix/domains/system/fleet-exporter/runtime.py:295-328 | nix/domains/system/fleet-exporter/runtime.py:359-392 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/system/fleet-exporter/runtime.py:295\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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2cea6e7d0fdabfd1e5ec86ee8036feb609c0e6ac14297bcbb342663d3e2a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): antithesis/workload/control/dispatch.py:207-231 | antithesis/workload/control/dispatch.py:291-313 \u2014 both copies are in the same file, so extract the block 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":"antithesis/workload/control/dispatch.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"075ccb8c3b074514c3b12032d7a8b01e7d4112ec7c8cbafe85919c570503e2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): antithesis/workload/control/rotation.py:56-75 | antithesis/workload/repository/restart.py:49-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. 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":"antithesis/workload/control/rotation.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2263f09788e0b707dc287218b4cdcde08bbcb3b34262413a8c45752ebd3572f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): nix/domains/artifacts/guest/inception/private_pki.py:92-111 | nix/domains/artifacts/guest/inception/private_runtime.py:75-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":"nix/domains/artifacts/guest/inception/private_pki.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a801f933424d1bab5ecc7e76cf329bf705d6b39b5804da7853dc3098a88ffa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): nix/domains/system/fleet-exporter/runtime.py:336-355 | nix/domains/system/fleet-exporter/runtime.py:396-415 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/system/fleet-exporter/runtime.py:336\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":"nix/domains/system/fleet-exporter/runtime.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d121116f2c0d080ddbfa36c16273605bc708d0ee98cfbeb8ad3594e233fd75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): antithesis/emulation/host/runner.py:182-200 | antithesis/emulation/recorder/runner.py:152-170 | antithesis/emulation/storage/runner.py:181-199 \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. 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":"antithesis/emulation/host/runner.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"296f0e72eb9755e947b189928ebbf4cbe30a70aed7bc1ba9f2e759a6376b43af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): antithesis/workload/control/delivery.py:131-149 | antithesis/workload/control/dispatch.py:35-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. 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":"antithesis/workload/control/delivery.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47607d86835ed47b5dd91b4d1ef655a527b066e24fbb511cd9176c5d378dc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): nix/domains/artifacts/guest/inception/control_tls.py:164-182 | nix/domains/artifacts/guest/inception/observations.py:214-232 \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 \u0060nix/domains/artifacts/guest/inception/control_tls.py:164\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":"nix/domains/artifacts/guest/inception/control_tls.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c980998226993e6e7ade513f5b6141d5d24917a8d3ce848596bdbe93971fbab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): antithesis/workload/control/host_sessions.py:204-218 | antithesis/workload/control/host_sessions.py:285-302 \u2014 both copies are in the same file, so extract the block 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 \u0060antithesis/workload/control/host_sessions.py:204\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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ca609d2649b1496bc553509e87eb526f43d243ad97c496d87fc0686bb5a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): antithesis/emulation/host/runner.py:33-48 | antithesis/emulation/recorder/runner.py:32-48 \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":"antithesis/emulation/host/runner.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86b3c032dbd8801cb360310439b5926f3438034bded40a920e9321827c5dbb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): antithesis/verification/campaign.py:389-405 | antithesis/verification/campaign.py:415-429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/verification/campaign.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d83ebb7d4ac0d4cf4506c958cd787d122c3b68b3fe4e64c654bd95bae2f96ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): nix/domains/system/proxy-address.py:18-34 | nix/domains/system/runtime-socket.py:22-36 \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":"nix/domains/system/proxy-address.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"28332df9d02aa921412b6a4195e568b88492825a6c1a71736577301132a6f427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): antithesis/workload/repository/fixture.py:50-65 | antithesis/workload/satellite/origin.py:70-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/repository/fixture.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9499f0b3cbd6d8f5635934333627b383a0f45b256cd20b53e071e6f5f31060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201315 lines \u00D7 3): antithesis/emulation/host/runner.py:95-109 | antithesis/emulation/recorder/runner.py:78-81 | antithesis/emulation/storage/runner.py:83-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note 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":"antithesis/emulation/host/runner.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd47bdab3abc094f601144ea3244f8faf04e5b424726ce78013ea7928391413d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:109-123 | nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py:270-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":"nix/domains/artifacts/guest/illumos_sdk/fetch_git.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfea091566b1e30dc8ad44a3755cc76f970c8ddc81cc8402454c1b299a174f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): antithesis/verification/selection.py:141-154 | antithesis/verification/selection.py:158-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. 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":"antithesis/verification/selection.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ef39ffa919799c0bb1b31a9f79d712114f9a606a9962501d6c6963c1d3582b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): antithesis/workload/admission/client.py:247-260 | antithesis/workload/admission/client.py:297-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/admission/client.py:247\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060antithesis/workload/admission/client.py:310\u0060 calls \u0060get\u0060 and \u0060antithesis/workload/admission/client.py:261\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":"antithesis/workload/admission/client.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26eb73a2741e1cdf39896731cc63277713e5e8e4e3262324f09e814b8564ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): antithesis/workload/repository/operator.py:38-50 | antithesis/workload/repository/restart.py:43-55 | antithesis/workload/satellite/operator.py:63-75 \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. 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":"antithesis/workload/repository/operator.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5ae6b5a558f93e5dcce87f56bdb35ed9e9ccd59b7566d081133f6dd4161613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): antithesis/workload/access/oracle.py:124-135 | antithesis/workload/access/oracle.py:142-153 | antithesis/workload/access/oracle.py:160-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/access/oracle.py:124\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":"antithesis/workload/access/oracle.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb664ec7f7c654f65a87e2064b882778746a827825c8bf152abcefddd0989f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): antithesis/workload/terminal/scenarios.py:329-340 | antithesis/workload/terminal/scenarios.py:370-380 | antithesis/workload/terminal/scenarios.py:413-424 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/terminal/scenarios.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb746b2a4f58fd179e6f7b41ea17cc588f8e3620b014ec28e1cd5c66c1d8cce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): nix/domains/artifacts/guest/inception/control_proofs.py:62-73 | nix/domains/artifacts/guest/inception/private_pki.py:100-111 | nix/domains/artifacts/guest/inception/private_runtime.py:81-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/control_proofs.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9693d98aa204af5559a80111683033c04574421126e36f8452a6a517cc2e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): antithesis/emulation/storage/origin.py:42-51 | antithesis/emulation/storage/origin.py: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/emulation/storage/origin.py:42\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":"antithesis/emulation/storage/origin.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ba205c2843bd085e88943ff10f8580061b06cd63505014be714c7383ff82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): antithesis/workload/admission/scenarios.py:336-347 | antithesis/workload/admission/scenarios.py:358-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/admission/scenarios.py:336\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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5f1ba2b4b7b9be9fbeb904fcf967311418fe402f1af4520d864a3055e791ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): antithesis/workload/control/host_sessions.py:58-69 | antithesis/workload/control/scenarios.py:45-56 \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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb036ce05cc69735187087d4c369f7d8a3075cf0abfe88fe095401da7730f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): antithesis/workload/control/host_sessions.py:221-232 | antithesis/workload/control/host_sessions.py:357-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/control/host_sessions.py:221\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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ee69dd476d5e427a65b883d69ac0ac70d090c3fbe44d5187e34705fc99542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): antithesis/workload/guest_lifecycle/operation.py:144-155 | antithesis/workload/satellite/operator.py:69-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. 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":"antithesis/workload/guest_lifecycle/operation.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f36d3d0ad221251e5aa2b1e6247f64ed95ec12625b467caf70d1f9864398f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): antithesis/workload/satellite/scenarios.py:217-228 | antithesis/workload/satellite/scenarios.py:250-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. 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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dbb555660942594e61f2303f7196994b62fdaf3f7887a39029a646a9ee301d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): antithesis/workload/access/browser.py:317-328 | antithesis/workload/admission/client.py:113-124 | antithesis/workload/control/rotation.py:42-53 | antithesis/workload/guest_lifecycle/operation.py:121-132 | antithesis/workload/repository/operator.py:30-41 | antithesis/workload/repository/restart.py:35-46 | antithesis/workload/satellite/operator.py:55-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/browser.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de8784c16a861e789d201068c1ff6739132261519833e8bf071386df4123d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): antithesis/emulation/guest/runner.py:775-785 | antithesis/emulation/guest/runner.py:827-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad6d90ba21abef6f78f79f5cb7e9c28b555d4b27af72b2eac4bb5e8a0cc7fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): antithesis/emulation/host/runner.py:164-174 | antithesis/emulation/storage/runner.py:163-173 \u2014 \u0060antithesis/emulation/host/runner.py\u0060 and \u0060antithesis/emulation/storage/runner.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"antithesis/emulation/host/runner.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ed70aab0a3ab2a3fdbdab24e49927abec0c27214e234428ce923d6f9a2ca23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): antithesis/verification/identity.py:810-820 | antithesis/verification/identity.py:852-862 \u2014 both copies are in the same file, so extract the block 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 \u0060antithesis/verification/identity.py:810\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":"antithesis/verification/identity.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcbc73b685d8a2e8cf1779cad27435ff91773bde8cce2ad1e83f23d909ec070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): antithesis/workload/admission/scenarios.py:221-231 | antithesis/workload/admission/scenarios.py:306-316 \u2014 both copies are in the same file, so extract the block 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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cef86290efdecb9e4fe1bfa40101d0d94c52478b4d23a546b1650b24c5cecfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): antithesis/emulation/host/bootstrap.py:58-67 | antithesis/emulation/host/private_bootstrap.py:62-71 | antithesis/emulation/host/runner.py:74-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da59e73aeef4a0b9cb72c52acbcedaf739fc6d6324c9651f3e806644ffa4b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): antithesis/workload/control/delivery.py:136-145 | antithesis/workload/control/dispatch.py:40-49 | antithesis/workload/control/scenarios.py:44-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 all 3 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":"antithesis/workload/control/delivery.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d456ea8af30699f0cbb2532539e8b420085b8ec81446b698b103c3fd39ddb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): antithesis/emulation/guest/runner.py:195-204 | antithesis/emulation/storage/bootstrap.py:42-51 \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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2158775725160ee72f0c8c84af73470d979c8fb363a0ca77dac628a4a27cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): antithesis/workload/satellite/scenarios.py:177-186 | antithesis/workload/satellite/scenarios.py:237-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/satellite/scenarios.py:177\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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"df95e47493c9ef61536a5f990d9dc7f2828d35827f986383ae76366c97d5126d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): nix/domains/system/auto-update/runtime.py:1055-1064 | nix/domains/system/auto-update/runtime.py:1082-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fbc7fe058e868208b3c50fe7d8e5ce263fa18c5b0b87840d4eea987f6d4e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): antithesis/emulation/guest/runner.py:643-650 | antithesis/emulation/guest/runner.py:776-783 | antithesis/emulation/guest/runner.py:828-835 | antithesis/emulation/guest/server.py:799-807 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/emulation/guest/runner.py:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060antithesis/emulation/guest/server.py:808\u0060 calls \u0060record_matches\u0060, \u0060get\u0060 and \u0060antithesis/emulation/guest/runner.py:784\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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be660362401d735eb9dc70ef6d5da9f036ca3e12ccad13fd4c379f533b47f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): antithesis/emulation/guest/runner.py:197-205 | antithesis/emulation/storage/bootstrap.py:44-52 | antithesis/emulation/storage/runner.py:70-78 \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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c70161320af6b1ff7cf1150052651eadabf9ec8f1289681690be1a3e2e6f5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/workload/access/oracle.py:46-54 | antithesis/workload/admission/oracle.py:201-209 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/access/oracle.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. 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":"antithesis/workload/access/oracle.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfa7534e50a4964baff48e67a4e7bdbdfbe367df07aeac24a951506ad426091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/workload/admission/client.py:138-146 | antithesis/workload/guest_lifecycle/operation.py:151-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/admission/client.py:138\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060antithesis/workload/guest_lifecycle/operation.py:160\u0060 calls \u0060get\u0060 and \u0060antithesis/workload/admission/client.py:147\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":"antithesis/workload/admission/client.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a7ff0895232779c9134ba96034377bb79ddc04334cfd02b86bc38fe59d962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/workload/admission/oracle.py:72-80 | antithesis/workload/terminal/oracle.py:85-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/admission/oracle.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. 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":"antithesis/workload/admission/oracle.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac9aa9f7888aa8d78476e71f7c0b2c81576291854995fc8b0db102f7c65c7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/workload/control/oracle.py:45-53 | antithesis/workload/control/oracle.py:106-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. 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":"antithesis/workload/control/oracle.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a9df44bed97247629bbeba7316ca82235d032d7d474589cf2c64e3308c3291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): antithesis/workload/repository/client.py:64-72 | antithesis/workload/repository/client.py:84-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/repository/client.py:64\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":"antithesis/workload/repository/client.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2572e075901d48fa8ce1f417c37e07785793ffb0052ec3d16f7f62fdb191774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:85-95 | nix/domains/artifacts/guest/illumos_sdk/fetch_sdk.py:260-268 \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 \u0060nix/domains/artifacts/guest/illumos_sdk/fetch_git.py:85\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":"nix/domains/artifacts/guest/illumos_sdk/fetch_git.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d5e634d3a92c2694cac539ca939f889e1af0879d21c2f72ded9880910e0eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): nix/domains/system/backups/common.py:78-86 | nix/domains/system/backups/restic.py:84-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":"nix/domains/system/backups/common.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb826a0da0a04653ff012e1551760bbf11534f6c9539b0182d7a6f07b99eabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): antithesis/emulation/guest/runner.py:343-349 | antithesis/emulation/guest/server.py:470-477 \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 \u0060antithesis/emulation/guest/runner.py:343\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":"antithesis/emulation/guest/runner.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d3d522d8c78245865ff4a08b9d7e6bf54fcce04d037c0cf2d16466845a4cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): antithesis/workload/access/mail.py:80-87 | antithesis/workload/access/mail.py:104-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/access/mail.py:80\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":"antithesis/workload/access/mail.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6eb87fc7811169ee54450a66b33616225ae5be5d4fc149674e8b28ee7b2936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): antithesis/workload/access/mail.py:89-96 | antithesis/workload/access/mail.py:113-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/access/mail.py:89\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":"antithesis/workload/access/mail.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"37772623c68af2cc9253c009f20cebb581abd6b9edbf283b3b8a54be4fa19fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): antithesis/workload/control/delivery.py:186-193 | antithesis/workload/control/delivery.py:203-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. 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":"antithesis/workload/control/delivery.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38fb7f032ecaf8dacaf34a23fb2210c5ba17810bddb3c5835d9923289799b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): antithesis/workload/repository/fixture.py:28-35 | antithesis/workload/satellite/origin.py:48-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":"antithesis/workload/repository/fixture.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec77fbd6afe33f10ce72e2971a8b25ed9a08ce0cd5046c15bdf889f2153a0766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py:17-25 | nix/domains/artifacts/guest/native-kernels/illumos/extract_viosock_lifetime.py:16-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/native-kernels/illumos/extract_listener_reset.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be3abcc00d85259492831ffcec59345cd7fe839e349c8264131fbb4890c9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nix/domains/artifacts/vscode-web/extensions.py:515-522 | nix/domains/artifacts/vscode-web/extensions.py:573-580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/extensions.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad53cf95fcbc7b3776d8e4d9d4baf5ef8c7d2df360cbfe879bc568557b9159dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nix/domains/system/fleet-exporter/exporter.py:212-219 | nix/domains/system/logging/health.py: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060nix/domains/system/fleet-exporter/exporter.py:223\u0060 calls \u0060BoundedSemaphore\u0060 and \u0060nix/domains/system/logging/health.py:228\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":"nix/domains/system/fleet-exporter/exporter.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b753684152987031612d2addfeee49ce3bd3d4e0e325bd7e793f883bd5ed1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): antithesis/emulation/guest/server.py:418-424 | antithesis/emulation/guest/server.py:689-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/server.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d76ae4d648c060f055dacabb2433288134f043bd81f1e9e7f874d9e9fe88d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): antithesis/workload/admission/scenarios.py:346-352 | antithesis/workload/admission/scenarios.py: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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafa9912a79639d77be0e4e8ec2c0f19f6c892b65fb9b65d3b73aea9e6bb43fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): antithesis/workload/control/host_sessions.py:91-97 | antithesis/workload/terminal/oracle.py:102-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/control/host_sessions.py:91\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":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d636459ddba2959098631a6882c767c092ed18f841fe4f6746d493ea896a698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): antithesis/workload/repository/fixture.py:42-48 | antithesis/workload/satellite/origin.py:62-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/repository/fixture.py:42\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":"antithesis/workload/repository/fixture.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"52683f0b813849c9310eb3ba1d20079164543ccc7d552ec4b079c74c41350b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): antithesis/workload/repository/observer.py:94-100 | antithesis/workload/repository/observer.py:134-140 \u2014 both copies are in the same file, so extract the block 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 \u0060antithesis/workload/repository/observer.py:94\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":"antithesis/workload/repository/observer.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f3595590b7b7c7b74bcd848790dcc9ab62a394bb945f1609b08a618380a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nix/domains/system/auto-update/resources.py:413-419 | nix/domains/system/auto-update/runtime.py:318-324 \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":"nix/domains/system/auto-update/resources.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a47aed127507412b50a4ec8bfd77b6af85f63702b9d22aa0c6f9f2260036cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): antithesis/emulation/host/runner.py:121-126 | antithesis/emulation/recorder/runner.py:106-111 \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":"antithesis/emulation/host/runner.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f61352c5163ff089cd38e40d38f2877428c56875d00e28d2b0d78c84f0929f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): antithesis/workload/satellite/scenarios.py:123-129 | antithesis/workload/satellite/scenarios.py:151-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/satellite/scenarios.py:123\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":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ed903fd66cc223f632f9a626a87463f8d18cd7d93a756f413f167c71a82585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py:192-197 | nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py:192\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":"nix/domains/artifacts/guest/native-kernels/illumos/native_candidate.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3da6f799af04c0fc3518036ead3a3a738e1e0b896d0180f1bcf9cb50fe0ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): nix/domains/artifacts/guest/inception/control_tls.py:167-171 | nix/domains/artifacts/guest/inception/observations.py:217-221 | nix/domains/artifacts/guest/inception/runtime.py:62-66 \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":"nix/domains/artifacts/guest/inception/control_tls.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e718b20fbea3898eb45237d075bd6015229e06ff3da855400d241c9fa131bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): antithesis/emulation/host/bootstrap.py:51-55 | antithesis/emulation/host/runner.py:67-71 \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":"antithesis/emulation/host/bootstrap.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb715be1cd0ccdd9ca1f5123e7f216683a9fac8a767db231959b7c7a5b86010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): antithesis/workload/recorder/client.py:236-242 | audi/priv/private_pki/authority.py:221-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":"antithesis/workload/recorder/client.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"368267e9b029d89f2f0efc2d0bc20eb340b58f9ae40cfc1d672fc32b875a5751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marshall/scripts/browser_terminal_probe.py:71-76 | marshall/scripts/browser_terminal_probe.py:97-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":"marshall/scripts/browser_terminal_probe.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb89006473d7eb5f174fccdce8a61e397a18192428c8bd3306abc90eeab49535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): antithesis/emulation/host/runner.py:59-63 | antithesis/emulation/recorder/runner.py:59-63 | antithesis/emulation/storage/runner.py:59-63 \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. 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":"antithesis/emulation/host/runner.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f55f31eae7b7b61cf49b13d20434bccae631f3605d97682110aacca73f19d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): mila/native/android/scripts/packaged_instrumentation.py:242-249 | nix/domains/artifacts/vscode-web/extensions.py:80-87 | nix/domains/system/otel-guest/browser_journey.py:244-251 \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. 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":"mila/native/android/scripts/packaged_instrumentation.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"695cdb358848c7be59de3b1f3735e4ae11af82c26b08561a08edcef649301473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): antithesis/emulation/storage/runner.py:339-343 | antithesis/emulation/storage/smoke.py:106-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060antithesis/emulation/storage/runner.py:338\u0060 calls \u0060add_argument\u0060 and \u0060antithesis/emulation/storage/smoke.py:105\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":"antithesis/emulation/storage/runner.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a0b9f2d82b56ed02bb389e70680f57912345b7efaeb13b1b5adfdb3df7f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): nix/domains/artifacts/guest/inception/observations.py:89-93 | nix/domains/artifacts/guest/inception/publication.py:93-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. 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":"nix/domains/artifacts/guest/inception/observations.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba78aa29e09ac3ab4fb234be9042f786240716489eb03a72fa813d15610e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): nix/domains/artifacts/guest/inception/publication.py:75-79 | nix/domains/artifacts/guest/inception/publication.py:314-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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"96497bfcec840b49110972adbab53dec4923a4ca0d322fae7e8aa54b2f369fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift:716-720 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:278-282 \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":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b292d1236cef41fedf8436e709f5fe45a1603ba157562371293df134f0ebffeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:376-380 | mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:391-395 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift:376\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":"mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"002fe0f53dae09438a6661ed0494391d4101e0ddf0f0f41719b5b9f306e797ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201335 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:944-978 | mila/rust/mila-ffi/src/session.rs:1025-1054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6dd18c5e685b58d8d2a5ffb1e6878ba0c216bbf2bd5d73fef6a3ec7c7f3e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:1451-1473 | mila/rust/mila-ffi/src/session.rs:1661-1683 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/session.rs:1451\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"10020c1b88b5eea68577cfb2b744008f6f4b75d2d2e49bf4413b28572b5ce5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): mila/native/linux/src/gtk_journey.rs:609-630 | mila/native/linux/src/gtk_journey.rs:714-734 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/gtk_journey.rs:609\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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7225bbad7250f2a3bd27f36f0f62a5301958f8dd271b2726f5fd02f72bb3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 3): mila/rust/mila-ffi/src/session.rs:422-437 | mila/rust/mila-ffi/src/session.rs:554-569 | mila/rust/mila-ffi/src/session.rs:610-630 \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 \u0060mila/rust/mila-ffi/src/session.rs:610\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c89a52574b4ca97665d152f8885f4e171824df5d69525a61a9134ab209c1cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:83-106 | lyra/src/workspace_receiver.rs:62-85 \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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9893eec4319621514d926968a2a1b378601c224d81b159db41312547ffe2a61e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): nix/domains/artifacts/terminald/src/sys/conpty.rs:495-513 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:347-367 \u2014 before extracting anything, compare \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs\u0060 and \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs:495\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":"nix/domains/artifacts/terminald/src/sys/conpty.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a4c10ee55cfbffb27fb7520cadcadcc4ba7c3fd1de7d8f44bb303bbef95fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/main.rs:21-39 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:229-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nix/domains/system/otel-guest/receiver/src/main.rs:21\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da43de522d660e00115836af34d95476ff0c8050b5f43143aaed6a3445e3789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lilly/native/hostd/src/session.rs:420-440 | lilly/native/hostd/src/session.rs:449-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/native/hostd/src/session.rs:420\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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dc2b5a9526392a866eeb9c655f58909f362d806c64f07c525603d7915c65c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:260-277 | nix/domains/artifacts/vscode-web-broker/src/windows/job.rs:43-60 | nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:70-87 \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":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aad3a65d1eb38a74d5fd5d74a9b17948157d4176f13eaf0a7757f352600cb8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:520-536 | lyra/src/guest/ssh_roster.rs:273-289 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"288b7e19ba9c0040f727ade57ea0c64a1c80174d82145de31b11f158b7eccd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:459-475 | lyra/src/bin/overalls-workspaced.rs:35-51 \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 \u0060lyra/src/bin/overalls-trustd.rs:459\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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e2fad58c1af35836b28d4bf44f1deeb8bfaf8530a89061f3be68d61cc5f866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): mila/rust/mila-ffi/src/commands.rs:32-48 | mila/rust/mila-ffi/src/commands.rs:112-128 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/commands.rs:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mila/rust/mila-ffi/src/commands.rs:31\u0060 calls \u0060format\u0060 and \u0060mila/rust/mila-ffi/src/commands.rs:111\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":"mila/rust/mila-ffi/src/commands.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c421b231009dca0ca8b8dea488ef75c587e9679d341f44173c158964b9318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:478-493 | lyra/src/bin/overalls-workspaced.rs:113-128 \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 \u0060lyra/src/bin/overalls-trustd.rs:478\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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcc729ee47ff75435daef7ebfd0793b1ff1845867b3d410ff16d990a338221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mila/native/linux/src/route.rs:421-436 | mila/rust/mila-model/src/source.rs:62-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. 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":"mila/native/linux/src/route.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc34998e9669cfbe19555fa527236b6821629aa51b172c8dd1853e7479b911e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/slo.rs:394-409 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:173-188 \u2014 before extracting anything, compare \u0060nix/domains/system/otel-guest/receiver/src/slo.rs\u0060 and \u0060nix/domains/system/otel-guest/receiver/src/underclass_probe.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nix/domains/system/otel-guest/receiver/src/slo.rs:394\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf6cccebc7b2ce71db19981f13813986f96275ba6c4f9810d1ad152c5fd1812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lyra/src/sys/windows/iphlp.rs:32-46 | lyra/src/sys/windows/iphlp.rs:53-67 \u2014 both copies are in the same file, so extract the block 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 \u0060lyra/src/sys/windows/iphlp.rs:32\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":"lyra/src/sys/windows/iphlp.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f18ee6e1160c51b58cbcfe10c7ad573917c09d3f1a22464638c9c0c7196aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): elixir/diagnostics/native/spool/src/sys.rs:35-48 | nix/domains/system/otel-guest/receiver/src/main.rs:27-39 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:235-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/diagnostics/native/spool/src/sys.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stream\u0060 to \u0060\u0026impl AsRawFd\u0060 in one and \u0060\u0026UnixStream\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/native/spool/src/sys.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a9a61491a5b0f4f2a5ef7e99697cde9c6ad67f192f2283dc35913f86eabe62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): mila/rust/mila-ffi/src/session.rs:641-653 | mila/rust/mila-ffi/src/session.rs:967-980 | mila/rust/mila-ffi/src/session.rs:1045-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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c8f80636682777fdc09da86c52dc068851f3ef46f2389b86846ef91871798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mila/native/linux/src/session/commands.rs:140-153 | mila/native/linux/src/session/commands.rs:176-189 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/session/commands.rs:140\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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b039bcc8c641f6452382fc6932d20b48677b39ea464223e0d18f83cb7049d06d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mila/rust/mila-journey/src/main.rs:596-609 | mila/rust/mila-journey/src/main.rs:618-631 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-journey/src/main.rs:596\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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"68545358ea165328eb6039bcbd732b4d0164a481165bb37e049e38ceb7d69ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:44-57 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:166-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:44\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":"nix/domains/artifacts/vscode-web-broker/src/windows/account.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"24785efd9ffc32963953f7a8bce122d8535c1a039e6b9e916bf2a8ecf2dcae18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lyra/src/bin/overalls-host-certificate-windows.rs:107-119 | lyra/src/bin/overalls-host-certificate.rs:93-104 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-host-certificate-windows.rs\u0060 and \u0060lyra/src/bin/overalls-host-certificate.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-host-certificate-windows.rs:107\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":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59edc634f24e4dd79862917291a55295a84edf0874fc6111bdac2a463167abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mila/native/linux/src/pages.rs:711-723 | mila/native/linux/src/pages.rs:735-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:711\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"40210a116047897fdb8545e59d9e3bb5fa4b344a0caa60d14097a59d1be4e220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mila/rust/mila-runtime/src/screen.rs:490-502 | mila/rust/mila-runtime/src/screen.rs:511-523 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-runtime/src/screen.rs:490\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":"mila/rust/mila-runtime/src/screen.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8419649ebdb8910397b83a4f0d37d9916f24afd6ed617ac265212704817292fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lilly/native/export-channel/src/bridge.rs:77-88 | lilly/native/export-channel/src/serve.rs:132-143 \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 \u0060lilly/native/export-channel/src/bridge.rs:77\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":"lilly/native/export-channel/src/bridge.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcf454d83bc758ca88c8ff4b4246f4ad7f5500b122a3c9413c82879601d6676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lilly/native/source-export/src/pin_sender.rs:13-24 | lilly/native/transfer-stream/src/pin.rs:39-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/native/source-export/src/pin_sender.rs:13\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":"lilly/native/source-export/src/pin_sender.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4ec67021f4881be3e85d363166251e65bb3ab7ca557f85686c8b825e9697ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:129-147 | lyra/src/guest/trust.rs:68-87 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-trustd.rs\u0060 and \u0060lyra/src/guest/trust.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-trustd.rs:129\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lyra/src/bin/overalls-trustd.rs:148\u0060 calls \u0060from_pem\u0060, \u0060as_bytes\u0060, \u0060is_err\u0060 and \u0060lyra/src/guest/trust.rs:88\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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff0cb88d02a8371752a299eb07d3c809d6b2340f2d949b954df8891003325f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mila/native/linux/src/route.rs:250-261 | mila/rust/mila-model/src/route.rs:215-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ee775dfd5765fb3ca6862ddc291ad3966b24e42366eb66396131bc38b067c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:485-496 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:497-508 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:485\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":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aa38bce935d6bff708dc9d55832a198cf5b047c7268336aa9b8ab834550212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): nix/domains/system/observability-runtimes/src/fleet_exporter.rs:16-27 | nix/domains/system/observability-runtimes/src/logging_health.rs:26-37 \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 \u0060nix/domains/system/observability-runtimes/src/fleet_exporter.rs:16\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":"nix/domains/system/observability-runtimes/src/fleet_exporter.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b305bc1057b9afcc4e6f2584bf37c111722a859fbe57362a796d556def2e068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): lyra/src/bin/overalls-readinessd.rs:151-161 | lyra/src/bin/overalls-trustd-windows.rs:128-137 | lyra/src/bin/overalls-workspaced-windows.rs:188-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-readinessd.rs:151\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-readinessd.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"27165a8613ad146bd2a94812522c99840c65fb3e36d08fefc1fb7b2508e0afb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:79-89 | lyra/src/guest/ssh_roster.rs:118-128 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lyra/src/bin/overalls-ssh-authorize.rs:79\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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaacee0f53f47670b9376cbc6bbf9ce68260e719f075b93640622e8670267e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mila/rust/mila-ffi/src/android/session_bridge.rs:210-220 | mila/rust/mila-ffi/src/android/session_bridge.rs:253-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/rust/mila-ffi/src/android/session_bridge.rs:210\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc445c61afd8f1a01a42ba3e348ec7a6977ccd22f9cf4d0d197688fa5e62d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mila/rust/mila-ffi/src/android/terminal.rs:93-104 | mila/rust/mila-ffi/src/android/terminal.rs:167-177 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/android/terminal.rs:93\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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee6e658c183603d2da540b598fb8d7b7bbc4c1730ad14f49276e34c233163d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mila/rust/mila-ffi/src/android/terminal.rs:288-298 | mila/rust/mila-ffi/src/android/watch.rs:50-60 \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 \u0060mila/rust/mila-ffi/src/android/terminal.rs:288\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 \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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2a68f288ea659644523ea64aa8194eb948f503735b48a3ecefa62a8b40d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mila/rust/mila-ffi/src/android/validation.rs:29-39 | mila/rust/mila-ffi/src/android/validation.rs:40-50 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/validation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1475dd7506bed68265fe47adbace8c9757d0a42c7cc6978affb28a51fc45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:49-59 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:109-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:49\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 \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":"nix/domains/artifacts/vscode-web-broker/src/windows/account.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c453ece638c6df917b9c9f40249d9b0928bb6e655463d8636d21eb435f73ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:315-325 | nix/domains/artifacts/vscode-web-broker/src/windows/files.rs:350-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. 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":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7c81690df6f81e810c4b0f1b2643ae6657348e442bd599ee26df23548ba7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lyra/src/agent/maintenance.rs:524-533 | lyra/src/agent/maintenance.rs:964-973 \u2014 both copies are in the same file, so extract the block 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 \u0060lyra/src/agent/maintenance.rs:524\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":"lyra/src/agent/maintenance.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c76f46af55727aeb34bdaef28ddd817ad50c8a46505bb52b8a9ac8c7c86b8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lyra/src/bin/overalls-readinessd.rs:95-104 | lyra/src/bin/overalls-trustd-windows.rs:33-42 \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":"lyra/src/bin/overalls-readinessd.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a3d81e9def21cee782fac37e5a4718040d06e22977eb2d029e5f008a29927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:429-438 | lyra/src/guest/trust.rs:130-139 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-trustd.rs\u0060 and \u0060lyra/src/guest/trust.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. 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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"236a0be9c9a8b0afd99f87cc6f8e6cd640476dca508453959509d5bb5858dea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): mila/native/linux/src/adapter.rs:326-332 | mila/native/linux/src/adapter.rs:359-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/adapter.rs:359\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":"mila/native/linux/src/adapter.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1475e4dc4eaccb23cf6f958abbb3bedce991556d23ded40881c385873e1d5d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mila/native/linux/src/session/commands.rs:79-88 | mila/native/linux/src/session/commands.rs:484-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/session/commands.rs:79\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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d83e08504f29c3f52e7451c99346db2561bf700e154a60142ba9712c5b050c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mila/native/linux/src/session/commands.rs:227-236 | mila/native/linux/src/session/commands.rs:512-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/session/commands.rs:227\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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f917ab45307da5657a39c049df41f2ff8a242f413d0be62fbada59766c3769d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mila/native/linux/src/session/trust.rs:120-129 | mila/native/linux/src/session/trust.rs:184-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/session/trust.rs:120\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":"mila/native/linux/src/session/trust.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89a1c645041992f43709d74874f260bc48d4f67029ed196b339938f197cb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mila/rust/mila-ffi/src/android/terminal.rs:370-379 | mila/rust/mila-ffi/src/android/terminal.rs:413-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. 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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c98851e1bd2ec2c0c0e6db30d320481a7201b0eb77e90e338f11dd1852c378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/main.rs:142-151 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:173-178 \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 \u0060nix/domains/system/otel-guest/receiver/src/main.rs:142\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":"nix/domains/system/otel-guest/receiver/src/main.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff51c93955b96d45f27284217fa00f3511e6780e96610bde614c52c1162c8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/request_recorder.rs:273-282 | nix/domains/system/otel-guest/receiver/src/request_recorder.rs:670-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/request_recorder.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eefb71a1489bcfcd599a2e1294a24d4948b4359cc6d9d2c93901a47ac79c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 5): mila/rust/mila-ffi/src/session.rs:374-382 | mila/rust/mila-ffi/src/session.rs:466-474 | mila/rust/mila-ffi/src/session.rs:504-511 | mila/rust/mila-ffi/src/session.rs:730-737 | mila/rust/mila-ffi/src/session.rs:1125-1132 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/rust/mila-ffi/src/session.rs:374\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mila/rust/mila-ffi/src/session.rs:388\u0060 calls \u0060from_utf8\u0060, \u0060bytes\u0060, \u0060map_err\u0060 and \u0060mila/rust/mila-ffi/src/session.rs:476\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"80469ac242ef696a35666c4f0d87e0b60210a2508425e61bc00c3834a74e4d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): lyra/src/guest/mmds.rs:53-61 | lyra/src/guest/readiness.rs:45-53 | lyra/src/native_guest.rs:325-333 | lyra/src/platform/windows/boot_id.rs:21-29 \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. 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":"lyra/src/guest/mmds.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"be08686af72b0e2beb49f648fc0068191ab32dfc63322b5b36343a3843c26863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): mila/rust/mila-ffi/src/session.rs:284-292 | mila/rust/mila-ffi/src/session.rs:546-554 | mila/rust/mila-ffi/src/session.rs:870-878 | mila/rust/mila-ffi/src/session.rs:1200-1208 \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 \u0060mila/rust/mila-ffi/src/session.rs:284\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace795ca358646016078e7bd0421da94397c142d07d698f1e497c8917b3bbc56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): elixir/diagnostics/native/spool/src/schema.rs:23-31 | lyra/src/agent.rs:481-489 | lyra/src/agent_cli.rs:204-212 \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. 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":"elixir/diagnostics/native/spool/src/schema.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e419123141e4dfd260f8876eea2e8b359cca8047d217150a9ebf591f58320f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lyra/src/bin/overalls-ssh-authorize.rs:89-97 | lyra/src/ssh_config.rs:33-41 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:35-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-ssh-authorize.rs:89\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lyra/src/ssh_config.rs:30\u0060 calls \u0060is_ascii_lowercase\u0060, \u0060is_ascii_digit\u0060 and \u0060nix/domains/artifacts/vscode-web-broker/src/validate.rs:34\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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7636927a7d69c03bc994c50c30caa2c718cd266eebf6178cea5fb127c9636b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lyra/src/config.rs:146-154 | lyra/src/ssh_certificate.rs:21-29 | mila/rust/mila-runtime/src/push.rs:302-310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/config.rs:146\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":"lyra/src/config.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"198aa29e5443c3e40da4f92ebcc3e10e80ee9aaa633ff133fa380ee113081c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): mila/native/linux/src/pages.rs:708-716 | mila/native/linux/src/pages.rs:732-740 | mila/native/linux/src/views.rs:755-763 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:708\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"409a591ff8467d67a32a833150973afc042dae9a30995eb1a9227421d963fd2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/native/hostd/src/exec.rs:501-509 | lilly/native/hostd/src/exec.rs:700-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/native/hostd/src/exec.rs:501\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":"lilly/native/hostd/src/exec.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a9361b9b24c448b77694d619927cb31636cd44769f64510427a5d8d0b626ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/native/hostd/src/protocol.rs:726-734 | lilly/native/hostd/src/protocol.rs:745-753 \u2014 both copies are in the same file, so extract the block 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 \u0060lilly/native/hostd/src/protocol.rs:745\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lilly/native/hostd/src/protocol.rs:744\u0060 calls \u0060extend\u0060 and \u0060lilly/native/hostd/src/protocol.rs:725\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":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"df662ff76910003655ce718892ace778f42c49a1596557d135ea13471544436e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/native/hostd/src/protocol.rs:807-815 | lilly/native/hostd/src/protocol.rs:836-844 \u2014 both copies are in the same file, so extract the block 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 \u0060lilly/native/hostd/src/protocol.rs:836\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":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a472504c3951c8d0498e80bc3b907114de620add906d4bc92512b14f1883a498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lilly/native/hostd/src/session.rs:761-769 | lilly/native/hostd/src/session.rs:900-908 \u2014 both copies are in the same file, so extract the block 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 \u0060lilly/native/hostd/src/session.rs:761\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":"lilly/native/hostd/src/session.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"c755b064175bc0851dcf5425cab996df1450e71834edc835c9a99b7acc36acf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lyra/src/agent/managed_skills/validate.rs:35-43 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:14-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/agent/managed_skills/validate.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"407f00f649d1e99b7c14b2e26d9b9e722f1e9cfe9c237981b297d48606610042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mila/native/linux/src/gtk_journey.rs:543-551 | mila/native/linux/src/gtk_journey.rs:571-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/gtk_journey.rs:543\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":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd70934eed20411254bb8fc9840f5f44267d1d460a3ff2f6edcd00ce2ca80075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mila/native/linux/src/machine_view.rs:63-71 | mila/native/linux/src/machine_view.rs:137-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/machine_view.rs:63\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":"mila/native/linux/src/machine_view.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b3164f47bca3ec82e12fbaf8983c394069b42fec92910b229da9a18d7ff65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mila/native/linux/src/route.rs:439-451 | mila/rust/mila-model/src/lib.rs:22-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/route.rs:439\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":"mila/native/linux/src/route.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b482d2134448fcbae98a1624c906e15d675d29342ea65479ab487ed5309a13f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mila/native/linux/src/session/commands.rs:130-138 | mila/native/linux/src/session/commands.rs:166-174 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/session/commands.rs:130\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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519a70e503cd490f809fa8c2b566b9449e2afda27b1ac96411d3b91abb8ab04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mila/rust/mila-ffi/src/android/session_bridge.rs:340-348 | mila/rust/mila-ffi/src/android/session_bridge.rs:394-402 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/android/session_bridge.rs:340\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0689da89e96b213e9fe92e90393758b2cd927f42975ce06d317a9b57c83be3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:1698-1706 | mila/rust/mila-ffi/src/session.rs:1745-1753 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/session.rs:1698\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"0299480959c3fb9e99e77bd4f3d94c64774dad194d8f05611facd064dcc5839d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): nix/domains/artifacts/terminald/src/main.rs:148-156 | nix/domains/artifacts/terminald/src/main.rs:161-169 \u2014 both copies are in the same file, so extract the block 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":"nix/domains/artifacts/terminald/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6613c72695c80a5ebbf9cbdf34e45c083413c4242f71b29d5069af783261c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): mila/rust/mila-ffi/src/android/session_bridge.rs:160-167 | mila/rust/mila-ffi/src/android/session_bridge.rs:198-205 | mila/rust/mila-ffi/src/android/session_bridge.rs:241-248 | mila/rust/mila-ffi/src/android/session_bridge.rs:280-287 | mila/rust/mila-ffi/src/android/session_bridge.rs:481-488 | mila/rust/mila-ffi/src/android/session_bridge.rs:697-704 | mila/rust/mila-ffi/src/android/session_bridge.rs:749-756 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mila/rust/mila-ffi/src/android/session_bridge.rs:478\u0060 calls \u0060Ok\u0060, \u0060try_from\u0060 and \u0060mila/rust/mila-ffi/src/android/session_bridge.rs:240\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6366afd6730c476c1bf0a3d961b0ea7cf7365a217f4247429a40614ab9307a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/native/hostd/src/files.rs:146-153 | lilly/native/hostd/src/mounts.rs:37-44 \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":"lilly/native/hostd/src/files.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0f9f6a41df60cbc139e0931927f756380b25e11c70c5001c15a9ece97dadf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/native/resume-token/src/cli.rs:6-13 | lilly/native/transfer-stream/src/cli.rs:22-29 \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":"lilly/native/resume-token/src/cli.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"263331aa3c14b6ec8db8182aa8cc17b48e8fd095ffc2e861809b32182775e5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lyra/src/bin/overalls-agentd-windows.rs:82-89 | lyra/src/bin/overalls-native-agentd.rs:62-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-agentd-windows.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"661cd3a2ea71bcf398fd3f05597c0f908b4a0aa340cdf3a5453a89b059486cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mila/native/linux/src/pages.rs:352-359 | mila/native/linux/src/pages.rs:1036-1043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/pages.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d02e34fabd3ee4e27f9b5308de93a33355eefcd31ba1319f237f46b7753e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mila/native/linux/src/pages.rs:497-504 | mila/native/linux/src/pages.rs:563-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:497\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2fcf23176705dd08a81ce557df8f6618c692cf8af7394f9951b8ca57a7d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mila/native/linux/src/views.rs:660-667 | mila/native/linux/src/views.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/views.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/views.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f395dde37e9cdf81b1637266c20cfcec2e98a959b7d39dcbbbf11b8c69e9d60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mila/rust/mila-ffi/src/actions.rs:32-39 | mila/rust/mila-ffi/src/validate/snapshot.rs:39-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/actions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2309f5b6ed36ab94ae4d02bedd00c9dbeb2cbf096cb0d830f22bb3092d2f00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:1429-1436 | mila/rust/mila-ffi/src/session.rs:1650-1657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mila/rust/mila-ffi/src/session.rs:1425\u0060 calls \u0060text\u0060 and \u0060mila/rust/mila-ffi/src/session.rs:1648\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5f80dd8957336de547c1959e3c09cb8165511fec1aa1d51d2309c1331ae10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): mila/rust/mila-ffi/src/session.rs:317-326 | mila/rust/mila-ffi/src/session.rs:1455-1461 | mila/rust/mila-ffi/src/session.rs:1665-1671 | mila/rust/mila-ffi/src/session/watch.rs:46-52 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/rust/mila-ffi/src/session.rs:1455\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a15d9ca8bfef5caf3c2080437bf38b6b5d63536934a332ed0f3f47d86dda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mila/native/linux/src/pages.rs:711-717 | mila/native/linux/src/pages.rs:735-741 | mila/native/linux/src/views.rs:737-743 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:711\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, \u0060mila/native/linux/src/views.rs:735\u0060 calls \u0060with_label\u0060, \u0060text\u0060 and \u0060mila/native/linux/src/pages.rs:709\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"013bbfd25602b2a74f948e291c8d88195c541a179620a7fe00f8ba5a3866fbba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mila/native/linux/src/route.rs:253-259 | mila/rust/mila-model/src/route.rs:218-224 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:46-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note 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":"mila/native/linux/src/route.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a920fd9a65248b38c80212824c6f12d176ca8265635f017d7fc0c6c0181d9f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mila/rust/mila-ffi/src/session.rs:766-772 | mila/rust/mila-ffi/src/session.rs:800-806 | mila/rust/mila-ffi/src/session.rs:833-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/rust/mila-ffi/src/session.rs:766\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b106d3b54b42128cff4ba5b268a8e30e68e57e59b45f41b2a9a6441999d08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lilly/native/transfer-stream/src/run.rs:88-94 | lilly/native/transfer-stream/src/run.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":"lilly/native/transfer-stream/src/run.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fdf3085b134864d701ee65acccf4e1148f18d0c7d39937b97aa4bc8e2dcc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-host-certificate-windows.rs:51-57 | lyra/src/bin/overalls-ssh-sync-windows.rs:69-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 both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e03a725fb6d8d80523d11b8d4ecfa1adc787d3898bd2fdd01030ca9ac6dc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-host-certificate-windows.rs:78-84 | lyra/src/bin/overalls-host-certificate.rs:62-68 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-host-certificate-windows.rs\u0060 and \u0060lyra/src/bin/overalls-host-certificate.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-host-certificate-windows.rs:78\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":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3cab4d929cdfc1f51f86ca4653920d6959207a715696f5a764273d768a6e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:103-109 | lyra/src/guest/ssh_roster.rs:168-174 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lyra/src/bin/overalls-ssh-authorize.rs:103\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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a527576e85f0f271ce3d8f844b2573a67b6f599a221b558e3487d54205e1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:406-412 | lyra/src/guest/ssh_roster.rs:248-254 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060lyra/src/bin/overalls-ssh-authorize.rs:406\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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25bb42e33b5248af17e7e61caaf0710b87a7c7b455769cb5509a3fc5a1a33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/native/linux/src/pages.rs:878-884 | mila/native/linux/src/views.rs:133-139 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:878\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6159980218802cc97d05753eaa5c457cc77c805aed1aaef1aee87b99022cd237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/native/linux/src/session/commands.rs:209-215 | mila/native/linux/src/session/commands.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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3091457f44e03351417a19e8b953908bc349dd73c97cb1e46e23aae99860b09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/rust/mila-ffi/src/android/session_bridge.rs:392-398 | mila/rust/mila-ffi/src/android/terminal.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. 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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a35d513e89492d7f7567601fd75778ecbe0d14721a170a23301e890329e56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/rust/mila-ffi/src/android/terminal.rs:241-247 | mila/rust/mila-ffi/src/android/terminal.rs:277-283 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/android/terminal.rs:241\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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f23c0a19807639978dbee720625baff99bd241aa7cab494cf7d0bac4e3c0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/rust/mila-ffi/src/android/validation.rs:188-194 | mila/rust/mila-ffi/src/android/validation.rs:212-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/validation.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1387819b1ca95cf843b4817aba24a9a5d06e429299a991898d25c87b2c7a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:911-917 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:567-573 \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":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"67682628eefa244bb2245fd2624d0d98fe31f8fc75671ce7781caef99bfc438e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:660-666 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:694-700 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/artifacts/vscode-web-broker/src/windows_main.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows_main.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"640f73975946913a312a305aabe13e290557c0dcd93a0b0552eed886fc5fd2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/sanitize.rs:94-100 | nix/domains/system/otel-guest/receiver/src/sanitize.rs:156-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":"nix/domains/system/otel-guest/receiver/src/sanitize.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"03305eccd1ea4ba0839a059c3879a355239c98b681786666f9e8a0e1b65b106d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): lilly/native/boot-log/src/main.rs:9-14 | lilly/native/ingress-bridge/src/main.rs:9-14 | lilly/native/launch-guard/src/main.rs:9-14 | lilly/native/resume-token/src/main.rs:9-14 | lilly/native/source-export/src/main.rs:9-14 | lilly/native/transfer-stream/src/main.rs:9-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. 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":"lilly/native/boot-log/src/main.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db849d07d6f5b1247878e990789080883d41372eb1005174b68e1d691a7e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): mila/native/linux/src/pages.rs:785-790 | mila/native/linux/src/pages.rs:828-833 | mila/native/linux/src/pages.rs:1063-1068 | mila/native/linux/src/views.rs:136-141 | mila/native/linux/src/views.rs:1135-1140 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:785\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7c7043324f397f7f1a700f249011e27db61df5ccbe1dae3aaaa0b5070bfae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): mila/native/linux/src/pages.rs:712-717 | mila/native/linux/src/pages.rs:736-741 | mila/native/linux/src/views.rs:245-250 | mila/native/linux/src/views.rs:738-743 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:712\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, \u0060mila/native/linux/src/views.rs:737\u0060 calls \u0060clone\u0060 and \u0060mila/native/linux/src/views.rs:244\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14882c6a05b9d6f85ecc9c449e891622e9c0bd0032ba80225212d561abe7e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lilly/native/image-copy/src/materialize.rs:31-38 | lilly/native/image-copy/src/materialize.rs:71-78 \u2014 both copies are in the same file, so extract the block 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 \u0060lilly/native/image-copy/src/materialize.rs:31\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":"lilly/native/image-copy/src/materialize.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e937444d2fc67733f276995c5d6833e2cf46d9f6906c2fe75ea123a5babf2444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lyra/src/bin/overalls-host-certificate-windows.rs:88-93 | lyra/src/bin/overalls-host-certificate.rs:74-79 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-host-certificate-windows.rs\u0060 and \u0060lyra/src/bin/overalls-host-certificate.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-host-certificate-windows.rs:88\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":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b74e4b268b6392fcd201925a8c5a39a45660975d055f11bb87a7ebbf260a799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:152-161 | lyra/src/guest/trust.rs:92-101 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-trustd.rs\u0060 and \u0060lyra/src/guest/trust.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-trustd.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lyra/src/guest/trust.rs:91\u0060 calls \u0060push\u0060, \u0060der\u0060 and \u0060lyra/src/bin/overalls-trustd.rs:151\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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d836c89eb6fcde07b8643dc1d9f561345065ec1d62a8c86dea6a103bc929046a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lyra/src/bin/overalls-winprobe.rs:52-57 | lyra/src/platform/windows/log.rs:54-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-winprobe.rs:52\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":"lyra/src/bin/overalls-winprobe.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa741a183f9719aa9ca8e47302a1221cd160322d91b3c1a01999fa4c6454ba68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/adapter.rs:69-75 | mila/native/linux/src/adapter.rs:232-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":"mila/native/linux/src/adapter.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df70eb57239a1f4e3884a54b34920fe41c9b7b89c1da81450d383a7784a41ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/adapter.rs:354-359 | mila/native/linux/src/adapter.rs:684-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":"mila/native/linux/src/adapter.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7b22ef860ecf5d2d0c767031e970acd1f9e33c41da845a17a0b3bc7e5f7b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/pages.rs:496-501 | mila/native/linux/src/pages.rs:946-951 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/pages.rs:496\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3788dd84db87f2cdab86591f233d1c254440cb0d025661bd0c4739022c88cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/pages.rs:496-501 | mila/native/linux/src/views.rs:542-547 \u2014 before extracting anything, compare \u0060mila/native/linux/src/pages.rs\u0060 and \u0060mila/native/linux/src/views.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/native/linux/src/pages.rs:496\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e694aac53a848b5ddee2e95d76dda3c490409e227b3d901387a299dabaf98b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/pages.rs:947-952 | mila/native/linux/src/pages.rs:1192-1197 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/pages.rs:947\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":"mila/native/linux/src/pages.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed6be80a9eb279998821ec7252ba60d71898221a0474ce06504060a8b15a456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/views.rs:217-222 | mila/native/linux/src/views.rs:758-763 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/native/linux/src/views.rs:217\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":"mila/native/linux/src/views.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4200c35d22d461bee7a6135add4b1c16d30aab346d88c438ba425e52e699249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/rust/mila-ffi/src/android/session_bridge.rs:333-338 | mila/rust/mila-ffi/src/android/session_bridge.rs:386-391 \u2014 both copies are in the same file, so extract the block 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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"07665870e74414e22f5d92941344bcdd5401f81cd4d049f56c09ac527ea4c3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:154-159 | mila/rust/mila-ffi/src/session/watch.rs:64-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mila/rust/mila-ffi/src/session.rs:154\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"44077153733398212b4792b9e91335ea75ac99c3bced924faf8a2c5e0570de93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nix/domains/artifacts/underclass/slo.rs:238-243 | nix/domains/artifacts/underclass/slo.rs:275-280 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/artifacts/underclass/slo.rs:238\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, \u0060nix/domains/artifacts/underclass/slo.rs:237\u0060 calls \u0060now_v7\u0060, \u0060to_string\u0060 and \u0060nix/domains/artifacts/underclass/slo.rs:274\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":"nix/domains/artifacts/underclass/slo.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a42a745fc9db2f17e82371779d4be0b3935bbcf85903ce37361eacb47b7def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/boot.rs:18-23 | nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs:188-193 \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 \u0060nix/domains/artifacts/vscode-web-broker/src/boot.rs:18\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":"nix/domains/artifacts/vscode-web-broker/src/boot.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"494502479f8122079d5d671187ff93c12affd8dc220a4496e28d6ef0763eea39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/windows/processes.rs:241-246 | nix/domains/artifacts/vscode-web-broker/src/windows/worker.rs:110-115 \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 \u0060nix/domains/artifacts/vscode-web-broker/src/windows/worker.rs:110\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":"nix/domains/artifacts/vscode-web-broker/src/windows/processes.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c2ba04b6b1683db368f416ef0f45e30ba9d878867eaac45daf866444d0400c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): mila/rust/mila-ffi/src/session.rs:341-345 | mila/rust/mila-ffi/src/session.rs:390-394 | mila/rust/mila-ffi/src/session.rs:438-442 | mila/rust/mila-ffi/src/session.rs:476-480 | mila/rust/mila-ffi/src/session.rs:513-517 | mila/rust/mila-ffi/src/session.rs:570-574 | mila/rust/mila-ffi/src/session.rs:739-743 | mila/rust/mila-ffi/src/session.rs:880-884 | mila/rust/mila-ffi/src/session.rs:1134-1138 | mila/rust/mila-ffi/src/session.rs:1210-1214 \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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"041ae8b990c4647a8ec6ff1db975b2f7bfc80f53c3acde439c595370ebc7cc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): mila/rust/mila-ffi/src/session.rs:286-292 | mila/rust/mila-ffi/src/session.rs:378-382 | mila/rust/mila-ffi/src/session.rs:467-474 | mila/rust/mila-ffi/src/session.rs:507-511 | mila/rust/mila-ffi/src/session.rs:550-554 | mila/rust/mila-ffi/src/session.rs:731-737 | mila/rust/mila-ffi/src/session.rs:874-878 | mila/rust/mila-ffi/src/session.rs:1128-1132 | mila/rust/mila-ffi/src/session.rs:1204-1208 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mila/rust/mila-ffi/src/session.rs:388\u0060 calls \u0060from_utf8\u0060, \u0060bytes\u0060, \u0060map_err\u0060 and \u0060mila/rust/mila-ffi/src/session.rs:476\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c9b28199c197ece1169d2fafa42d313bfe2450bd08a090e8db8b3d472c1e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/native/export-channel/src/pins.rs:11-15 | lilly/native/source-export/src/pin_sender.rs:10-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lilly/native/export-channel/src/pins.rs:11\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lilly/native/export-channel/src/pins.rs:19\u0060 calls \u0060signal\u0060 and \u0060lilly/native/source-export/src/pin_sender.rs:18\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":"lilly/native/export-channel/src/pins.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f219996df691035ce8b17a5abf7b3c7bca93df078f6e62b4560faf38a279588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/native/launch-guard/src/lib.rs:72-76 | lilly/native/source-export/src/cli.rs:16-20 \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":"lilly/native/launch-guard/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a381eac1945a25913234cf1eaf07bd018b7ae267c307a4043a6f7db91dfa957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/platform/windows/vsock.rs:53-59 | nix/domains/artifacts/terminald/src/vsock_windows.rs:59-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/platform/windows/vsock.rs:53\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":"lyra/src/platform/windows/vsock.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"696c17566ca17629f96ab2b77eaa30517ea45819b9e82d0192ac3951a344daf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mila/rust/mila-ffi/src/session.rs:1803-1809 | mila/rust/mila-ffi/src/session.rs:1865-1871 \u2014 both copies are in the same file, so extract the block 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 \u0060mila/rust/mila-ffi/src/session.rs:1803\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":"mila/rust/mila-ffi/src/session.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b035d2faa09cfc2d82be7c94c25d874b100413d1a9a24b3b2c5ee8d8282b503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): nix/domains/artifacts/vscode-web-broker/src/linux_main.rs:585-589 | nix/domains/artifacts/vscode-web-broker/src/windows_main.rs:312-316 \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":"nix/domains/artifacts/vscode-web-broker/src/linux_main.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafd895bd208f5f159f4440fae5ddf715368c10cce52bbe19e96746498c22fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lilly/native/hostd/src/nft_policy.rs:16-21 | lyra/src/agent/context.rs:120-125 | lyra/src/agent/maintenance.rs:96-101 | lyra/src/agent/managed_skills/validate.rs:56-61 \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":"lilly/native/hostd/src/nft_policy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35b8488455a691d2ef0393e77d34718eb40017f17f509e37367f257da33229e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lyra/src/bin/overalls-host-certificate-windows.rs:31-36 | lyra/src/bin/overalls-host-certificate.rs:52-57 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-host-certificate-windows.rs\u0060 and \u0060lyra/src/bin/overalls-host-certificate.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"lyra/src/bin/overalls-host-certificate-windows.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e5052ce6782b5d4d5aade340ae31a938fc72e85d82a1e5d7f9efd8450f6d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:506-517 | lyra/src/guest/ssh_roster.rs:186-197 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"74303f50c3b138e5bdbb47165f9a468023e5084f4e7f371e5ca0c0545e8bd055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lyra/src/bin/overalls-trustd.rs:70-79 | lyra/src/open_cli.rs:41-50 | lyra/src/workspace_receiver.rs:47-56 \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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9670ab04d20f7f94538ff1c3ce2e4c2ac97fb0d650c6dcc09f8b360744ba90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lyra/src/guest/mmds.rs:45-50 | lyra/src/guest/readiness.rs:37-42 | lyra/src/workspace_receiver.rs:40-45 | nix/domains/artifacts/vscode-web-broker/src/validate.rs:6-11 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lyra/src/workspace_receiver.rs:37\u0060 calls \u0060bytes\u0060, \u0060all\u0060, \u0060is_ascii_hexdigit\u0060 and \u0060lyra/src/guest/mmds.rs:45\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":"lyra/src/guest/mmds.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b7577f48513a7a7b14bd2626a0198d95944eb69d81e6785b9d06ebea557c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lyra/src/telemetry.rs:104-111 | nix/domains/system/otel-guest/receiver/src/slo.rs:411-418 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:190-197 \u2014 before extracting anything, compare \u0060nix/domains/system/otel-guest/receiver/src/slo.rs\u0060 and \u0060nix/domains/system/otel-guest/receiver/src/underclass_probe.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":"lyra/src/telemetry.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce761cb88ec366a80cda62c4492d3c71742c8479035883b54dfbe37637b84b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/slo.rs:245-252 | nix/domains/system/otel-guest/receiver/src/underclass_probe.rs:115-122 \u2014 before extracting anything, compare \u0060nix/domains/system/otel-guest/receiver/src/slo.rs\u0060 and \u0060nix/domains/system/otel-guest/receiver/src/underclass_probe.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":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3555e54d9ceab4973b9ee549caa3bd52684dd8af696a945d6f9c00bdd2515253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): mila/native/linux/src/session/commands.rs:17-25 | mila/native/linux/src/session/commands.rs:463-471 | mila/native/linux/src/session/connection.rs:86-94 \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":"mila/native/linux/src/session/commands.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a742a3766460f7f57588a365c767f4d6be699f70f14afe72a8e07f66a9df7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/rust/mila-ffi/src/android/terminal.rs:352-357 | mila/rust/mila-ffi/src/android/watch.rs:111-116 \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 \u0060mila/rust/mila-ffi/src/android/terminal.rs:352\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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7be294fc778ba711a27ce5d057f68c4c739753985172ec5897132a449e606c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): nix/domains/artifacts/terminald/src/sys/conpty.rs:451-466 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:307-321 \u2014 before extracting anything, compare \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs\u0060 and \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs:451\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":"nix/domains/artifacts/terminald/src/sys/conpty.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"88155179316a31a455a868739b172f7763c813d7ac5328268bb01b1a4dff9d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): nix/domains/system/otel-guest/receiver/src/slo.rs:350-360 | nix/domains/system/otel-guest/receiver/src/slo.rs:367-378 \u2014 both copies are in the same file, so extract the block 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 \u0060nix/domains/system/otel-guest/receiver/src/slo.rs:350\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":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21a41224c360126a70640ce4c78908c8427a80ae870469a18b6fd1b43d289a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): elixir/diagnostics/native/spool/src/store.rs:90-99 | nix/domains/system/otel-guest/receiver/src/durable_slo.rs:420-429 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/diagnostics/native/spool/src/store.rs:90\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":"elixir/diagnostics/native/spool/src/store.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4bc8fd4a698884955be8e8298ce8b96ec62ee8df3b14b335481a3144426003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): nix/domains/system/otel-guest/receiver/src/slo.rs:315-322 | nix/domains/system/otel-guest/receiver/src/slo.rs:352-361 | nix/domains/system/otel-guest/receiver/src/slo.rs:373-379 \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 \u0060nix/domains/system/otel-guest/receiver/src/slo.rs:315\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":"nix/domains/system/otel-guest/receiver/src/slo.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a78fc2affbcfb8babfbbe6749b38f2ce4986aa4bd218a217c0a3116588a1a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nix/domains/artifacts/terminald/src/sys/conpty.rs:424-432 | nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:295-301 \u2014 before extracting anything, compare \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs\u0060 and \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs:424\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060nix/domains/artifacts/vscode-web-broker/src/windows/account.rs:292\u0060 calls \u0060try_from\u0060, \u0060map_err\u0060 and \u0060nix/domains/artifacts/terminald/src/sys/conpty.rs:419\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":"nix/domains/artifacts/terminald/src/sys/conpty.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec92ecb6870e1e63543c8216d27bac59a22be5efbda6f2fbbf74ab49ec8496d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:145-152 | lyra/src/bin/overalls-ssh-authorize.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-ssh-authorize.rs: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. 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b0602d174495f33b32ceece69614f9ab0c4f1ecddd2995ccdfdf598875160b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:436-442 | lyra/src/private_http.rs:17-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. 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222194ceef1f9092ff8d0b69b8e897d906f2289cdc70234948d31ffe55ff1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lyra/src/bin/overalls-ssh-sync-windows.rs:149-155 | lyra/src/ssh_files.rs:59-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lyra/src/bin/overalls-ssh-sync-windows.rs:149\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":"lyra/src/bin/overalls-ssh-sync-windows.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f18d75dd37f5f65b4da845669bbaecd24dfbb54804f07846d3a7f14261b4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lyra/src/proxy.rs:98-103 | lyra/src/ssh_config.rs:78-84 \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 \u0060lyra/src/proxy.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060lyra/src/ssh_config.rs:77\u0060 calls \u0060home\u0060, \u0060join\u0060 and \u0060lyra/src/proxy.rs:97\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":"lyra/src/proxy.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d4e92d50657db0c0304482ad1f89e7d1cc4b62ac508c05f7f9100730f140f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lyra/src/native_guest.rs:135-140 | lyra/src/native_guest.rs:176-181 \u2014 both copies are in the same file, so extract the block 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 \u0060lyra/src/native_guest.rs:135\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":"lyra/src/native_guest.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"537481e599398a3a67cecb47bfbe547d026538faf417afd749dff40ce3167067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mila/native/linux/src/notifications.rs:43-48 | mila/native/linux/src/persistence.rs:127-132 \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":"mila/native/linux/src/notifications.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2123e5e92946c0cd7bad27f28d4a4057ec6c9f5229020e5489c886a900da30d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lilly/native/hostd/src/descriptors.rs:85-89 | lilly/native/hostd/src/ingress.rs:166-170 \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":"lilly/native/hostd/src/descriptors.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"088294d7577cb297cddfb223b16c2d03cc064c0d92397fa2a3459306456eafb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lyra/src/bin/overalls-ssh-authorize.rs:72-76 | lyra/src/guest/ssh_roster.rs:105-109 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-ssh-authorize.rs\u0060 and \u0060lyra/src/guest/ssh_roster.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"lyra/src/bin/overalls-ssh-authorize.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"40af456d96e8ec2e4447dc415d8e1b0b3fec9edbf9ff4813c3a7fc6753118e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lyra/src/bin/overalls-trustd.rs:441-445 | lyra/src/guest/trust.rs:143-147 \u2014 before extracting anything, compare \u0060lyra/src/bin/overalls-trustd.rs\u0060 and \u0060lyra/src/guest/trust.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. 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":"lyra/src/bin/overalls-trustd.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc344cff532b8772c5e881c1f77065a7adadae9e90a42bd0a0c5adf2893e5f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/dependency_pins.ex:129-138 | scripts/dependency_pins.ex:174-186 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/dependency_pins.ex"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ae03322a6b3c0110ea1ea93f5e6ad152f7658ac5e5abf78d1fde79d4ba8d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/cargo_security_upgrades.exs:82-94 | scripts/mix_security_upgrades.exs:54-69 \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":"scripts/cargo_security_upgrades.exs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe21befca148b9788249722220c382240cc261b9f03487461c5660e15234109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): scripts/dependency_pins.ex:226-240 | scripts/dependency_pins.ex:440-456 | scripts/dependency_pins.ex:528-539 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/dependency_pins.ex"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e4d9144cb90125a1c2d17b27d08a0d584484ff7daf02796a4288f438def1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): scripts/egress_acceptance.py:40-42 | scripts/porsche_acceptance.py:66-68 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/egress_acceptance.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d15d69260c513b43400ee3c9b0340fa4bfb990b49137200f526b2b4dc0b5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): scripts/egress_acceptance.py:478-494 | scripts/egress_acceptance.py:663-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/egress_acceptance.py:478\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/egress_acceptance.py:496\u0060 calls \u0060fixture\u0060 and \u0060scripts/egress_acceptance.py:680\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":"scripts/egress_acceptance.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3ae3ad5f221843ee1c507987a88c73830472a252d39f7a8e96b4828f2d8abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): antithesis/fixtures/origin/server.py:264-277 | antithesis/fixtures/smtp/server.py:77-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060antithesis/fixtures/origin/server.py:278\u0060 calls \u0060get\u0060, \u0060add\u0060 and \u0060antithesis/fixtures/smtp/server.py:91\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":"antithesis/fixtures/origin/server.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"084c2622a32d50605718ab5811d4d4d4b23c452df20d6a9790435d184253e03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): antithesis/workload/backup/fixture.py:121-130 | antithesis/workload/backup/fixture.py:387-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/backup/fixture.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4482633e07710cfd8f9b0b304b7e79a033ebf74278e3e423fe6883d8f81f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): scripts/egress_acceptance.py:116-124 | scripts/galileo_acceptance.py:78-86 | scripts/porsche_acceptance.py:280-288 \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":"scripts/egress_acceptance.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f25b3e3a452fbe48151d663810e7399b1df651cd9c65e71a629c35ee922bce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): antithesis/workload/backup/fixture.py:217-224 | antithesis/workload/backup/fixture.py:261-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060antithesis/workload/backup/fixture.py:217\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":"antithesis/workload/backup/fixture.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7db6df31f5abbb921d88bf37f21b3903b88ac510fa71809811e4fd00d9c22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/egress_acceptance.py:552-558 | scripts/egress_acceptance.py:598-604 \u2014 both copies are in the same file, so extract the block 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/egress_acceptance.py:559\u0060 calls \u0060hexdigest\u0060 and \u0060scripts/egress_acceptance.py:605\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/egress_acceptance.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"46faa3d5f6a7fe4b1a8469962ba99cce5894601465997f1b941f34467c84c7d7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mila-model: mila-model: 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":"610b41e0df25a92d47282eb23eb471a06b7ee26869a8cebbc61c10e6746f1a0a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: overalls_antithesis_sdk: overalls_antithesis_sdk: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c891ef80ee2477050ceb130e4ab0f58cd59cac143056613943e8660b7fd95851"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: overalls_diagnostics: overalls_diagnostics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ea3ebda7c3642b56138d8913f3605ae21c1ae344b7a99b017b71fd80051942f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: overalls_request_accounting: overalls_request_accounting: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d74de307fa038f3c8ed8fe66b4315004ff31aa0c998470bc0bf212ebedfa259e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: overalls_protocol: overalls_protocol: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"89155cdd6b6ffd16f9f4a1832a4a1cc9340e30eee1267186525e00032dc4ee7d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mila-protocol: mila-protocol: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"655bc629fc2b95db361c8c451bc583422a88e84dae6436276e1707c82341d270"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FakeTerminal (LCOM4 4): FakeTerminal\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":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d8101be29ea8ae440b25967a010865897fd9367ad1138a215f85cfa9ba809"}},{"ruleId":"D12","level":"warning","message":{"text":"Retired release: earmark: \u0060:earmark\u0060 is pinned to 1.4.49 in the committed mix.lock, and the publisher deprecated it on hex.pm \u2014 \u0022Earmark is no longer maintained. Migrate to a replacement, for example MDEx (https://hex.pm/packages/mdex).\u0022. A retired release is one the publisher has asked you to stop using. Move off it and commit the updated lockfile."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f34482362fb4d020aaa1bfb5acdc5f854677b33586d7ddfeceec5c9cb1a5e35a"}},{"ruleId":"D12","level":"warning","message":{"text":"Unbounded dependency requirement: postgrex: Runtime dependency \u0060:postgrex\u0060 is declared \u0060\u0022\u003E= 0.0.0\u0022\u0060 in marshall/mix.exs, which has no upper bound \u2014 every future MAJOR release of \u0060:postgrex\u0060 satisfies it, so the next unlocked resolve can pull a breaking change. Use \u0060~\u003E\u0060 (e.g. \u0060\u0022~\u003E 1.0\u0022\u0060) to bound the requirement to a compatible range."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fcbc7082662e7dcc321686efdf20be35007c155396c10a8ef7dacec2a4eb4176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in MilaNativeUiKt.MilaNativeRoot at line 83. 16 of those changes were fix/bug commits, and the other 62 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b64f26c86d0898b341341aa6bf03b878ad6e934a4d6616eaf56fdb1c93ad59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift: mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SettingsView.body at line 594. 13 of those changes were fix/bug commits, and the other 59 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaNativeUI.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"222a834a9fe9e1fe37bd0d37d713a5f751ddd018c41c6a7f7a4d9d190f6836c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet-smoke/Program.cs: mila/windows-dotnet-smoke/Program.cs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Program.Main at line 17. 15 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet-smoke/Program.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/Program.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8214d7f1d21bb07f17e2413b00889f51d6539b7237ed4d426fbd8f8c78d81c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift: mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in MilaRouteParser.parse at line 26. 14 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e721fc9c797cc92e38b646d5d14ac34fd9bd7d0b02b579fb354d46f053b3d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/linux/src/main.rs: mila/native/linux/src/main.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NativeState::ensure_window at line 425. 7 of those changes were fix/bug commits, and the other 72 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/linux/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":"mila/native/linux/src/main.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82fdec1e75b254221969e304c2aa16e28e987bfea5e17c92eac36fb4829e874"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/MainWindow.xaml.cs: mila/windows-dotnet/MainWindow.xaml.cs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MainWindow.RefreshMachines at line 958. 14 of those changes were fix/bug commits, and the other 73 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/MainWindow.xaml.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"e524318a60108e19bbe8f260bbf531ed16a9b381498418453fb419d5186e372d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MilaFfiAdapterKt.parseMilaRoute at line 24. 7 of those changes were fix/bug commits, and the other 39 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaFfiAdapter.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e2850bdf1522742a37b10f3a912e0d84845b4a47757d968f3b7e828df3ef6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/Interop/RustNative.cs: mila/windows-dotnet/Interop/RustNative.cs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in MilaRouteParser.Parse at line 23. 2 of those changes were fix/bug commits, and the other 28 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/Interop/RustNative.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b0e858a11dea2110d30fe390f05dd600319c2f46b0ff2cb66c3f69325ec0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall_web/live/threads_live.ex: marshall/lib/marshall_web/live/threads_live.ex changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ThreadsLive.load at line 905. 3 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall_web/live/threads_live.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cd0013e7442f994441548cb1967d4feb8d6dc4e8046a48af748561070bf662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/linux/src/gtk_journey.rs: mila/native/linux/src/gtk_journey.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Script::step at line 1436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/linux/src/gtk_journey.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/gtk_journey.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1def26114bac7e4194a2530cbb6ad8f6a05d563131a824441067d6befb6ef76a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/vm/driver.ex: lilly/lib/lilly/vm/driver.ex changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Driver.resume 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/vm/driver.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602cc80cd5e86615e70d1927cc74f1ba0c4b4e335af159fcd2b54a64ee01a85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/policy.rs: lilly/native/hostd/src/policy.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in lilly_hostd::policy::ip 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/src/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":"lilly/native/hostd/src/policy.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"87540599544e0b7496261f093873447e1ea6c01b448986a87762bb947ecdb507"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/recorder/scenarios.py: antithesis/workload/recorder/scenarios.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in scenarios.run_traces 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/recorder/scenarios.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":"antithesis/workload/recorder/scenarios.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e098abf13537c44cf9e6e8b895bc374abb83b9ac6012ac46d0deb54651fb2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/scripts/monospace_browser_probe.py: marshall/scripts/monospace_browser_probe.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in monospace_browser_probe.run 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/scripts/monospace_browser_probe.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":"marshall/scripts/monospace_browser_probe.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61f5a860bceb403604832d60d5f53d5ed316bb2b6ad671c5b1586466c606743"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/agents/model_calls.ex: marshall/lib/marshall/agents/model_calls.ex changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ModelCalls.queue at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/agents/model_calls.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"339065af8b44f68c2a38b4c9a47ede2cc9ce7afab7d94c24f2a5f290db0fd69f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/linux/src/pages.rs: mila/native/linux/src/pages.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in mila_native_linux::pages::build_machines 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/linux/src/pages.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/pages.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"376db5c2c1c5a8672994aeb675e9ff140524861747fae45fb59ef0bc46cc23c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/verification/selection.py: antithesis/verification/selection.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in selection.validate_compose 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/verification/selection.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":"antithesis/verification/selection.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b762fe994985ead8d6e972aec9039565220ac647ffe39a03970de3f61d4fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/linux/src/journey.rs: mila/native/linux/src/journey.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mila_native_linux::journey::run at line 603. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/linux/src/journey.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/journey.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"b247ed17113d0f9177977d7d6ce29e2076093cc153672de524ed1480acf9352e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/linux/src/views.rs: mila/native/linux/src/views.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mila_native_linux::views::build_terminal at line 475. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/linux/src/views.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/views.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0e626f6916ca3b3e14e5f8b29d54b0f69e91de409d95ca2c52125f2f1b120a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/lib.rs: lilly/native/hostd/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in lilly_hostd::parse_options at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/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":"lilly/native/hostd/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7de74d3a451826d86b18f5bbbaad3cedc81d80919d0a979e426ba0da0ff0cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/session.rs: lilly/native/hostd/src/session.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Session::handle at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/session.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"03faa948fad5e058a39c1e4ce7827c9ce2290f95605f0c5fa93470041e0ce429"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/Interop/WindowsNotifications.cs: mila/windows-dotnet/Interop/WindowsNotifications.cs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MilaWindowsNotificationDevicesController.DecodeListing 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/Interop/WindowsNotifications.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WindowsNotifications.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02da0ed339da8616a0987823e5e9618e71815826fcf6fd35048c6b637e7b273"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/vm/executor.ex: lilly/lib/lilly/vm/executor.ex changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Executor.reconcile 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/vm/executor.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"43145b24db7b66d5540070ba270e4d7613504eac946ff5689e7a006052cbe7a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/repository/scenarios.py: antithesis/workload/repository/scenarios.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in scenarios.run_native_admission_after_restart 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/repository/scenarios.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":"antithesis/workload/repository/scenarios.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebfe1a8492e822044bb4e7621ff48af54ccc591e6db3cb3c3307fcf1f64814c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/domains/system/auto-update/runtime.py: nix/domains/system/auto-update/runtime.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Deployment.preflight at line 773. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/system/auto-update/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":"nix/domains/system/auto-update/runtime.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a54d2efdbde12b5c4430b93a6d055a8c989aaff664a692d08c73003bce7ed0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/protocol.rs: lilly/native/hostd/src/protocol.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in lilly_hostd::protocol::encode_request at line 684. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/src/protocol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/protocol.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"083379833acdd107e89d9b4670ef52dc17f60b98db802573727e94a36f1c589b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet-smoke/JourneySmoke.cs: mila/windows-dotnet-smoke/JourneySmoke.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MilaJourneyDescriptor.Parse 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet-smoke/JourneySmoke.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c79eabebf7c56e42bc00cd14ef237dd2233a12556ff279284e5fccda58993"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/guest_lifecycle/scenarios.py: antithesis/workload/guest_lifecycle/scenarios.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in scenarios.run_physical_boot_cycle at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/guest_lifecycle/scenarios.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":"antithesis/workload/guest_lifecycle/scenarios.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2062868204492c27b2b79f05fc00fcdf8253b78648d1b873ce81ad6641a16890"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/rust/mila-protocol/src/grammar.rs: mila/rust/mila-protocol/src/grammar.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in mila_protocol::grammar::validate_command at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/rust/mila-protocol/src/grammar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-protocol/src/grammar.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f439c2a8b8a0f92bc85e44e332022038622fa361a3f677b85b20c5fba529047e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/agents/prompt.ex: marshall/lib/marshall/agents/prompt.ex changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Prompt.admit! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/agents/prompt.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/prompt.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d365233a45f471736d097b77c268a378d0a9dc0ca7367bccffc5b9ce3fd7529"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/admission/scenarios.py: antithesis/workload/admission/scenarios.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in scenarios.run_key_survives_archive 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/admission/scenarios.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":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faecfc64c5fff403a2970de21520f27b225c8b9b7060c41a4e79e3cd1b9eb63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/Interop/TerminalStream.cs: mila/windows-dotnet/Interop/TerminalStream.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in MilaTerminalStream.AttachGeneration at line 377. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/Interop/TerminalStream.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"330a8997251500608bfc5688fb754e199ebdb772419fd89eb2fc91d06d53eff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MilaThreadDetailController.submit at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cad8f9d0d07ca784f7775778c95f5ce5f681ce706057b8e7a9d977e21ffe0be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/rust/mila-journey/src/main.rs: mila/rust/mila-journey/src/main.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Driver::authenticated at line 568. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/rust/mila-journey/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":"mila/rust/mila-journey/src/main.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f7c1380e464a139f8c2d84fab28926b307ada7cd3ca904e1cda2fb4ac8e31a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/vm/actor.ex: lilly/lib/lilly/vm/actor.ex changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Actor.handle_call 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/vm/actor.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"773c64a08e2a248daf4bb0b1b71f34bcad7a39a8cdcc2d7b259fd5bc11e15540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/galileo/authorizations.ex: marshall/lib/marshall/galileo/authorizations.ex changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Authorizations.current_vm! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/galileo/authorizations.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c93b02f27e306c7072960b5ca09762597c0ad535a05b1acc3fc7845d8f195d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/core/profile_readiness.py: antithesis/workload/core/profile_readiness.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in profile_readiness.repository_origin_ready at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/core/profile_readiness.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":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b847ab8c7792f2ede87604b4002af4213990f2a618732057210530bca3430b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/domains/artifacts/terminald/src/main.rs: nix/domains/artifacts/terminald/src/main.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in lilly_terminald::control_message at line 219. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/artifacts/terminald/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":"nix/domains/artifacts/terminald/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d954ca8bb207515c5bba015cfe9b0ef46deace3c34e5198b98bbf1183283315d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift: mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MilaMachineWorkflow.submit 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaMachineWorkflow.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970993067ff9a6cf245ad3b8f357ef7f8d87b177ffb940730c6438831bd99ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lyra/src/bin/overalls-native-workspaced.rs: lyra/src/bin/overalls-native-workspaced.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in lyra::bin::overalls-native-workspaced::main 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lyra/src/bin/overalls-native-workspaced.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/bin/overalls-native-workspaced.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85daa67868d0ecbc474c4ae6d0de99e2a409a4abf984d586d55c8f1c2b076e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/inception/runtime.ex: lilly/lib/lilly/inception/runtime.ex changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Runtime.poll_once at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/inception/runtime.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/inception/runtime.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca478b6504101c14c4c15f6317a38c97c2499dca90a1addc262beede3ad4d072"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/domains/artifacts/guest/inception/control_worker.py: nix/domains/artifacts/guest/inception/control_worker.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in control_worker.supervise at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/artifacts/guest/inception/control_worker.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":"nix/domains/artifacts/guest/inception/control_worker.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"831d61fb2cc62737e10f4cda89d2939eceb07d3a2b9e86eafec4786975eb3933"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/workload/core/bootstrap.py: antithesis/workload/core/bootstrap.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in bootstrap.probe 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/workload/core/bootstrap.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":"antithesis/workload/core/bootstrap.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ed3c236f8844e9100e9f59b804ae171ac0991eb4011bc1c336c76351df29d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: buck/rust_parity.py: buck/rust_parity.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rust_parity.main at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- buck/rust_parity.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":"buck/rust_parity.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e15505ce328c3c569bd80854ae11e1bb328fa4a0547d9d36e1f3df275a39749"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/Interop/WebEndpoint.cs: mila/windows-dotnet/Interop/WebEndpoint.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MilaWebEndpointDecoder.DecodeCore 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/Interop/WebEndpoint.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WebEndpoint.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8563293b071c0793d3aa49f3d4dab7424f18b60044b16f41e610c08ba2fbd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/compute/admission.ex: marshall/lib/marshall/compute/admission.ex changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Admission.allocate at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/compute/admission.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/admission.ex"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"254903904df6bf7316502c84ec0c383468068fcd52e1415a29f2a6e1124b96d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/domains/artifacts/terminald/src/session.rs: nix/domains/artifacts/terminald/src/session.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Daemon::attach 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/artifacts/terminald/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/session.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ba062a46f6be4d962e66cb2c2d573e41d109aafaf03d86f9703546d2508026"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/host/hostd.ex: lilly/lib/lilly/host/hostd.ex changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Hostd.reply 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/host/hostd.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/hostd.ex"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a4f97657e2facb55f86e96f3d50d2f50c4639c6b58e986111406ba1e1c1a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: elixir/diagnostics/native/spool/src/main.rs: elixir/diagnostics/native/spool/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in overalls_trace_spool::run 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- elixir/diagnostics/native/spool/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":"elixir/diagnostics/native/spool/src/main.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2af749699e0e91e072f3e3e1086aa8368e534d38590e8add8948ba61c80159b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/main.rs: lilly/native/hostd/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in lilly_hostd::run 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/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":"lilly/native/hostd/src/main.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"463687c65580e382bf40d165c11cfcc59343f9042422850ca0337d330e91a655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: antithesis/verification/campaign.py: antithesis/verification/campaign.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in campaign.reserve at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- antithesis/verification/campaign.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":"antithesis/verification/campaign.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a578387e9dcff19ed85f226675788ea6bda32123e9490c583aaa0b674842550"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lyra/src/update.rs: lyra/src/update.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in lyra::update::work 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lyra/src/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":"lyra/src/update.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"395f398e318c49c786b9ffeca2225ac895d1c87104f60aa9ef1559c266f9ab8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/inference/requests.ex: marshall/lib/marshall/inference/requests.ex changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Requests.current! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/inference/requests.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/inference/requests.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec1d41724dcf0d3ec96b6af6471d56c96a507bb74b5b3dfdf1ac123489d154e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: buck/affected.py: buck/affected.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in affected.select 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- buck/affected.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":"buck/affected.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6edd275e2af10c266dbd14bcbcff848244dfba27cf94ff1cf13ea30f31cc1c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/domains/artifacts/guest/inception/publication.py: nix/domains/artifacts/guest/inception/publication.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in publication.collect 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/artifacts/guest/inception/publication.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":"nix/domains/artifacts/guest/inception/publication.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9f0e9709191b2d9bf4d6c79c18839410d34d1d17b58e7f96c90cc2cc57d2b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/transfer.rs: lilly/native/hostd/src/transfer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in lilly_hostd::transfer::plan at line 561. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/src/transfer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/transfer.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"278dfb4d93ff20473ce0916581305c7c37c0bc272d720ea264989a03287cbd97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/windows-dotnet/Interop/ThreadListing.cs: mila/windows-dotnet/Interop/ThreadListing.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MilaThreadListing.Decode at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/windows-dotnet/Interop/ThreadListing.cs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/ThreadListing.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16837813a07abb23bf2a6c1a92c7d0e778eb96279b605a08ecf7d129c4e8aa1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/ingress/server.ex: lilly/lib/lilly/ingress/server.ex changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Server.init 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/ingress/server.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e3392303ba6dfe324d97c4debdee40ac470f5105e66e9dff20e788d0637fb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/compute/outcomes.ex: marshall/lib/marshall/compute/outcomes.ex changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Outcomes.apply! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/compute/outcomes.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e6cba4deefee4ab691c76ee3b813594688ce4e3dd6f48687da72a4db96dbe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mila/rust/mila-session/src/threads.rs: mila/rust/mila-session/src/threads.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ApplicationSession::thread_action 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/rust/mila-session/src/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":"mila/rust/mila-session/src/threads.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd8376fc84834babaf3366341ca4160c76363a049f38eeec4b1f38bc69787f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/compute/clone_placement.ex: marshall/lib/marshall/compute/clone_placement.ex changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ClonePlacement.reserve! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/compute/clone_placement.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/clone_placement.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc69a58978c1a9dde58d17e16acc8ce347b6b1e6c330ec074a5e2d6010f427f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nix/buck/rust_cell.py: nix/buck/rust_cell.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in rust_cell.generate at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/buck/rust_cell.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":"nix/buck/rust_cell.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6753f5a44378bf894eed4eb17dfa87ddfbd925c7d4b21eeb7d1508d1d785e29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/ingress/execution.ex: marshall/lib/marshall/ingress/execution.ex changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Execution.current! 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/ingress/execution.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5ee4256d8989c9ac57c3deb96210b313b2c0554b437f2cb00f184310fb76c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/transfer-stream/src/run.rs: lilly/native/transfer-stream/src/run.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in lilly_transfer_stream::run::sweep 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/transfer-stream/src/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":"lilly/native/transfer-stream/src/run.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843676990f360106547325bae2688d61af163c7b7922f232a77387a639231c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/terminal/sharing.ex: marshall/lib/marshall/terminal/sharing.ex changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Sharing.set 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/terminal/sharing.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/sharing.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2749ea1f5c1121ffb688fde19189aac3ec45fccfb780dd588196b39df53fd16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/porsche_acceptance.py: scripts/porsche_acceptance.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Acceptance.matrix_ssh at line 971. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- scripts/porsche_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/porsche_acceptance.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53de17cf3768eb680494697b4cb7d03b98e99249b17d2f2db9eca00a61fc50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/lib/lilly/transfer/source.ex: lilly/lib/lilly/transfer/source.ex changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Source.execute 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/transfer/source.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/source.ex"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3978c8fd9604e444974e5d734015657bbcb1a39b5aefce223bb445007528a598"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marshall/lib/marshall/accounts/administrators.ex: marshall/lib/marshall/accounts/administrators.ex changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Administrators.run 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/accounts/administrators.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/administrators.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be24eab1b19e6dd6afc6c18fc634c8f8f51cb487740c84ba689d097eabea123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lilly/native/hostd/src/files.rs: lilly/native/hostd/src/files.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in lilly_hostd::files::perform at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/native/hostd/src/files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/files.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"45587092bbdf328a2db49095daf5a3011adeeaec2c928b2d5734011e16aafa6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt: mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt 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 3 (its worst body is MilaSessionListing.boundedDisplay at line 12), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mila-android): decode the Rust session listing as JSON\u201D; \u201Cfix(android): cap machine listing projections\u201D; \u201Cfix(mila): repair native listing build errors\u201D; \u201Cfix(mila): stabilize native listing projections\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSessionListing.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b954f65ac0835103fb1a610bf54f44c72ad52743c616f3af1047a3d109152c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: marshall/lib/marshall/compute/ledger.ex: marshall/lib/marshall/compute/ledger.ex 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 8 (its worst body is Ledger.commit_scope at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native): retain lost-candidate promotions as exact verified outputs\u201D; \u201Cfix(marshall): guest-credential host reads take FOR KEY SHARE, fenced by FOR UPDATE writers\u201D; \u201Cfix(marshall): end compute_hosts lock convoy; stamp telemetry with deployment revision\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall/compute/ledger.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/ledger.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc76c088ef66903f0d78ac375dd5e8f63313b334dd6c0a14ab419944bc56ff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lilly/lib/lilly/terminal/stream.ex: lilly/lib/lilly/terminal/stream.ex 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 7 (its worst body is Stream.control at line 706), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix Android display relay connections\u201D; \u201CFix Android display stream cleanup\u201D; \u201CFix host boot-log access and OmniOS growth operand\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- lilly/lib/lilly/terminal/stream.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/stream.ex"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8b568a323234ace7ddeabff4aac7e5575f02496da041c09e7fd2fdadd529db"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: nix/domains/artifacts/guest/inception/control_proofs.py: nix/domains/artifacts/guest/inception/control_proofs.py 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 control_proofs.update at line 161), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: complete nested Inception bootstrap and validation\u201D; \u201Cnix: give BEAM proxy sockets the full start budget; fix ty gate\u201D; \u201Cfix: complete inception publication and certificate bootstrap\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- nix/domains/artifacts/guest/inception/control_proofs.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":"nix/domains/artifacts/guest/inception/control_proofs.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"196ea3891107f6d9323606328f8500f6112e2f3ced5754df2ea62d3db3d2ffbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: marshall/lib/marshall_web/live/admin/scim_live.ex: marshall/lib/marshall_web/live/admin/scim_live.ex 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 7 (its worst body is ScimLive.oidc_form at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scim): keep admin status page available on count errors\u201D; \u201Cfix(scim): give SCIM configuration its own elevation grammar\u201D; \u201Cfix(scim): real OIDC code flow, SCIM sign-in page and split admin operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 05:08:28 \u002B00:00\u0027 --until=\u00272026-11-16 05:08:28 \u002B00:00\u0027 --full-history --no-merges -- marshall/lib/marshall_web/live/admin/scim_live.ex\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/scim_live.ex"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"516b9c4fd768f170bcebe1114ef4b86d46afabcb8f26106399c5d3b1a052cc5f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneyPages.cs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d374c67a6db228eea02c6afb35a4903868c3e416b2c7b9da4821efe89825565"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneyPages.cs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5757eab8fa9f28a277065019e69cd0ba720b88b6b6e581c175aa96eb9b9e901e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"705c984c6ff79e556e9f38640d513b65b088217832d4fb39e514cb35b5866ed0"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee3191868a9fee523baf5c192fa1817a43d2309b17fd024f30d7144707c9a30"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-uia/LoopbackTrustListener.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b554fd682e3cdf016caf5c071eb413df64e66e9fb0bf3c31ddfab3d78e05041"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-uia/PickerJourney.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e59320da6c6b9c5f2c01d631462264c67f10d76bf194cfeec424b4c89907bfb"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/DeploymentStore.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"74345db0be8d5421691d4725c524dc6e921fb84f8cda913ed1a23c60174c8f9e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/DeploymentStore.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de83bea2bc50950a156f954ac9b99cba728682e81a46b507a612a79e0e966368"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/DeploymentStore.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebb168dbc6d5ce9cb1e9bbb2c01ae67759e7f0e8a1b60b5f15d243985664309"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/DeploymentStore.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"455ca1fa18cf63b5d861a6846f625dd8af3f7c181abd22f3f4e7c8ff3668d59c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/SignInCoordinator.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e003d47d974373f70ce677cbf8768020d0b8de49aeaba40217cd7bcbfcbb8b"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WatchStream.cs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"473a7209a67f2e0b85cc5321ad9ffd13ebb847810872ccb37121b5b3bc4adb6d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f421e04fdce859ac3e6916e47eb58dd49587bb8f935a7749dfcaed44f1f14fc8"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad76e22a5efd174f990e2cb1ecb12341c54dfa68737c37d15b2b2c1e4e8ff316"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MilaStrings.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"775e3ed579df8a7502d0c9124924557a52798a8059b04e5f78868833845c35e2"}},{"ruleId":"D17","level":"warning","message":{"text":"Dead code: TryClassifyMachineCommand: Method TryClassifyMachineCommand \u2014 Roslyn\u0027s SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository \u2014 a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol\u0027s name, and any project the workspace could not load. This is \u0027no caller found by this walk\u0027, not a verdict that the symbol is unused."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25814b04744dcc61bfbe1b38baf2a31e26235927875f4d95554b74d9d93a21e"}},{"ruleId":"D17","level":"warning","message":{"text":"Dead code: TrySessionTerminalPoll: Method TrySessionTerminalPoll \u2014 Roslyn\u0027s SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository \u2014 a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol\u0027s name, and any project the workspace could not load. This is \u0027no caller found by this walk\u0027, not a verdict that the symbol is unused."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"55af71b96e111cbdc296f90b201fb5d374710910ad1f90cfcce53eff013c806a"}},{"ruleId":"D17","level":"warning","message":{"text":"Dead code: TryValidatePushPoke: Method TryValidatePushPoke \u2014 Roslyn\u0027s SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository \u2014 a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol\u0027s name, and any project the workspace could not load. This is \u0027no caller found by this walk\u0027, not a verdict that the symbol is unused."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eb8dc3ee0cb49df872ca520d559e16077073c4c8e368846e200fe50cfe7171"}},{"ruleId":"D17","level":"warning","message":{"text":"Dead code: MilaUnavailablePokeKeySource: NamedType MilaUnavailablePokeKeySource \u2014 Roslyn\u0027s SymbolFinder walked every project the solution loads, including Mila.Windows, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository \u2014 a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol\u0027s name, and any project the workspace could not load. This is \u0027no caller found by this walk\u0027, not a verdict that the symbol is unused."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WindowsPushRegistration.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec256eb135c739532992a5be35ce5ff6ed78ceb27c32a356161ece15c54dc055"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no map of the repository\u0027s parts: The repository has 5 units (\u0060marvin\u0060, \u0060windows-dotnet\u0060, \u0060windows-dotnet-smoke\u0060, \u0060windows-dotnet-uia\u0060, \u0060code-contracts\u0060); \u0060README.md\u0060 and the documents it links name none of them. Add a short list of the parts and what each does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f047b1120601c2537f0645d9b67f052758989ccf5801de4d919633bcff2a3cc2"}},{"ruleId":"D20","level":"note","message":{"text":"ADR considers only one option: \u0060docs/architecture/decisions/0225-marshall-notifications-domain.md:42\u0060 lists one option, \u0022**Sending from the request process.** Rejected: provider latency and retries\u0022, so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0225-marshall-notifications-domain.md"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec677f5c701838d0208acc8abb80bc9b12b891b3461e080600d67a49b636206"}},{"ruleId":"D20","level":"note","message":{"text":"ADR considers only one option: \u0060docs/architecture/decisions/0226-monospace-web-on-flutter.md:34\u0060 lists one option, \u0022**Material or Cupertino defaults.** Rejected: a second visual language for\u0022, so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0226-monospace-web-on-flutter.md"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0519e8822c441969204b4ac27c6f7e9413b63bba06cc1b056c102ad76c9b8f49"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/architecture/decisions/0182-unprivileged-lilly-beam.md:5 says \u0022accepted\u0022, but docs/architecture/decisions/0183-guest-dataset-streams-in-hostd.md, docs/architecture/decisions/0184-lilly-owns-every-socket.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0182-unprivileged-lilly-beam.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6916fe1e89213a9cbee1bbd70f4afd6aeb6250d5aa6d1a4cb6f4f709a0f00018"}},{"ruleId":"D20","level":"note","message":{"text":"ADR decides a question another record already decided: docs/architecture/decisions/0204-git-attribution-and-guest-identity.md and docs/architecture/decisions/0198-git-attribution-and-guest-identity.md are both in force and decide the same question (\u0022ADR-0204: Git attribution and guest identity\u0022), and neither names the other. If this record replaces the earlier one, say so (\u0022Supersedes \u2026\u0022) and mark the earlier one superseded; if both hold, state how they relate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0204-git-attribution-and-guest-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"324ef9577cdaca89a308e468ce0bff9ea001364fa82e4b84b61d3400ea69cb4b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: ADR-0255: Thread lifecycle state machine and Oban server-tool dispatch: docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md:26 rules out \u0060status\u0060, but production code uses it: mila/windows-dotnet-smoke/JourneyPages.cs:80, mila/windows-dotnet-smoke/JourneyPages.cs:83, mila/windows-dotnet-smoke/JourneyPages.cs:372, mila/windows-dotnet-smoke/LifecycleSmoke.cs:190, mila/windows-dotnet-smoke/LifecycleSmoke.cs:558 (\u002B106 more). Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e46c0bbae0db6fa0bbaecc080a70eb3feb671bb59f12c675b9842a18d5d03a7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0002-elixir-ash-and-types.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0002-elixir-ash-and-types.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffa954b502d61d22db54258c7af667ed6512df0ceb75ef699d915212cc80db6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0003-control-plane-coordination.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0003-control-plane-coordination.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb3630512d8bedc5de48b676c5753cb58ce725a0325c84f9ec573ea048fc93f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0004-lilly-and-vm-actors.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0004-lilly-and-vm-actors.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad6902cec682d8d08cd78cfe8bcb3adc4d998845d6cc703679137aaf3ecce6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0011-nixos-guest-and-console.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0011-nixos-guest-and-console.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d3e948e33af28534592def074d74da60180949a659af2bbafe01b3b17f206f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0017-durable-vm-actors-and-host-ownership.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0017-durable-vm-actors-and-host-ownership.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4020dadf12a1380d47447ca4986eaca6e8479126e55f6210dab655ce86758e09"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0042-host-observability.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0042-host-observability.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"583536f966054cf47a7f206839434ab54c5095770ec78b5bc360aea75ea7a0ba"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0068-nix-built-ubuntu-guests.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0068-nix-built-ubuntu-guests.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe96081090701caec360ae7465922ca5837839278b2c7f87e1623a08dade5be1"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0071-required-lilly-transfer.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0071-required-lilly-transfer.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"52089361530101e9ff80311e4aa7d780616fafd0da94471d95ba3ae7937d8bbf"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0073-bounded-nix-store-reclamation.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0073-bounded-nix-store-reclamation.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1212244ef034518a9d353922a6bb76cda98c150198b32360f9825e4c21fa25e7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0075-fleet-overlay-and-source-access.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0075-fleet-overlay-and-source-access.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f13dceb8223a192da76dd1af24fecb6be162ac2277e38a9241485ab71fc42d"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0077-teams-and-shared-resources.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0077-teams-and-shared-resources.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e7c5d68f8db662aa1a440157e83f6087b6e147d38ebcbb6e020bc8b267d66e"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0079-peer-vm-vm-attestation.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0079-peer-vm-vm-attestation.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d292ecade37f79f5b35023c6f9e108b734739e2502ad068ce45fc04116033a94"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0080-named-edge-integrations.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0080-named-edge-integrations.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ef999062a89d98f2f86828098603ccf3d11467318f27dc9e60e31360733598"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0082-guest-terminal-multiplexer.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0082-guest-terminal-multiplexer.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ce926534787bc1f448ebfe06888794bd19f62baa780788fb77f805fd40107e"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0090-second-audi-dns-replica-on-worker.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0090-second-audi-dns-replica-on-worker.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e718195ddfbb54aa32f86c7b691a8b393a40aceb19671d80876d66b7c4cb06e9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0091-fleet-perimeter-public-listeners.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0091-fleet-perimeter-public-listeners.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea67c3753a557c346add9ffe230eab9023240ea7119e81245fd614ce90ab6750"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0092-portable-workload-bundles.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0092-portable-workload-bundles.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4d13eeaa937d55daa640296e98703960d6784d595c1df3e229f668c8340a84"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0097-enrico-git-mirrors.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0097-enrico-git-mirrors.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9ebdb6162abdf609d8696b85b7f94dc2811d8075ecd29eabd30c8216f5c84a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0101-browser-approved-agent-cli.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0101-browser-approved-agent-cli.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"654b616ef983fca35af25b2d1dc62353dbd5380e25321ae48cf30648647e64e9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0104-private-guest-cli-updates.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0104-private-guest-cli-updates.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5b95fbc96cf95822baaa2251ec5cf6c6704b3ca014533eba9ad2688c1b5bdd"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0106-inception-child-audi-wildcard.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0106-inception-child-audi-wildcard.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe4caf9ebabb0cd1edde2367ca079cff34162f9168a427a414b5e73b7fe43df"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0107-marshall-owned-agent-web-search.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0107-marshall-owned-agent-web-search.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb1a91993ceb9f4ba1c247821e68b64119f370846403237293b21787774aa9c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0108-guest-agent-web-fetch.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0108-guest-agent-web-fetch.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f275c4c2957fda6194ac06773210e9c3f120ca86a2d8a37bc23acf107d3d659"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0111-private-service-tls-names.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0111-private-service-tls-names.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240cb11678c8d79b06be667f75e77dec587239ca2d90607fe71ebe9fe7743c2"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0113-guest-trust-at-boot.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0113-guest-trust-at-boot.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9dfccab0d4643f12ca811dde1f2b70b150b98fb2b5f647a88efa36920a0cef"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0130-verified-provisioning-fastpath.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0130-verified-provisioning-fastpath.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbf710046e8a09b6de3659b999cf66167992460c5ab9e2ce9be85b836980e2a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0137-public-authenticated-grafana.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0137-public-authenticated-grafana.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c42c23921abfd502580d9c50b7dd1dfca76435ade51ebfbc8b71a28024f5d"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0139-private-slo-burn-delivery.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0139-private-slo-burn-delivery.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc5db158bbcb1652faf09adce1ea1ab15f41949169e74e3c3080e873f79b8b7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0140-event-driven-liveness-and-single-writer-views.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0140-event-driven-liveness-and-single-writer-views.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be214f755e35abdf46ebbd8a368bab43df7506c3dfa825e21eab1ef49cec8b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0141-control-plane-hints-and-resync.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0141-control-plane-hints-and-resync.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eb9dc825a31ed95385f62d2a44be0785169c043b8370e1c309f9a1546db2b6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0142-overallsprotocol-control-websocket.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0142-overallsprotocol-control-websocket.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5997695ec91e79f5208610d17bcaf823c58c0ce264d1a6ee06841993382d4fba"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0143-faster-create-clone-delete.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0143-faster-create-clone-delete.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7acc65e2746ec933c21d85fbd45fe37a0a3ec3926bcaa1bc2a93521f15bf1b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0144-nix-builds-exclude-guest-datasets.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0144-nix-builds-exclude-guest-datasets.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e407d32013d8bc8a9bbb3201dc2691991034c2aa5f7874b049f1a2e1205467a0"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0145-same-pool-block-cloned-clones.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0145-same-pool-block-cloned-clones.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c82b4f839f7f8437f15a2b17d68a11b98389baf87ab50e8f27339ea69d2db83"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0147-standard-profile-name.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0147-standard-profile-name.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6b585ebac40af579101f51943205bc518d7aac430afb183d4c351c83765cd8"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0152-lean-pool-locked-preparation.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0152-lean-pool-locked-preparation.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d306d4b65e61fc3be4371aef63227b266b0edce6d61ef59e1cc536bb34296"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0154-guest-boot-profile.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0154-guest-boot-profile.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd1d16014ff00ea4c04591c62cda4aaffcaf0edf31daa4c4f095a3912e56a46"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0156-browser-launcher-distribution.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0156-browser-launcher-distribution.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde6967935dc10d308e94dcae473557596cd0e58cfb6cbfb52000f13fa0d94f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0160-privileged-administrator-step-up.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0160-privileged-administrator-step-up.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1a22435f60b135f7d77f03698013ac74d290a7e93130d8882e50cf12b01a1a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0162-clone-cleanup-liveness.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0162-clone-cleanup-liveness.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24fc1a2c72df7933bc245178064ada8c1ac2bbe64e890da3ebc43a1e7f46f6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0163-bounded-standby-refill-and-capacity-damping.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0163-bounded-standby-refill-and-capacity-damping.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d267a95513aa2ed1ef0fe94be4b7d09a2b64f3d642964778a6484e85b787db7f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0164-arc-budget-and-safe-memory-decrease.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0164-arc-budget-and-safe-memory-decrease.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"76031697a097318dc5f4e5a02f6ed289ad9e3003497ef8a794b0e2dcf253303d"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0165-restart-only-changed-units.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0165-restart-only-changed-units.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e48e8559aa2eb64b365a2df2b6caa0ba601ce3d4c322d1128f66e302bdfb83"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0166-resize-hardening.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0166-resize-hardening.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f2a88dbfa035fce761fef834cabd5dcdd85bab1db1b63544d13363f5c67b6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0168-guest-coding-cli-dangerous-defaults.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0168-guest-coding-cli-dangerous-defaults.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c2554466311da8b244a0f9448e258d5c24bdb4a258d6b2a676adf19dbce2e9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0175-thread-sharing-and-bound-machine-authority.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0175-thread-sharing-and-bound-machine-authority.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db39b6dfe7d72a3da83056bdb0dc54ff2ee9a8f7e4f37d370a1635d5c2f813"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0178-durable-agent-context-and-planning.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0178-durable-agent-context-and-planning.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60b1b1398b2df57f945ef0aa7fa111c5b999186aeb4b76d08aab68d3492c008"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0179-guest-instructions-and-managed-skills.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0179-guest-instructions-and-managed-skills.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c3a6ccfecf382d032cc9f6e1b44f263dfa9b1de41f6a49e318ffd59b075fbc"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0181-public-proxy-http01-ingress.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0181-public-proxy-http01-ingress.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81d8cbc67e4b66e43e7aaa437f90774c46afe29c7f43aee4848edc941b45290"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0182-unprivileged-lilly-beam.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0182-unprivileged-lilly-beam.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"003a50e863ef4b20e71d6b6454470176424e4d806bd87a573687b9daa1433543"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0183-guest-dataset-streams-in-hostd.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0183-guest-dataset-streams-in-hostd.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb4a9ad4affe95c58c62c5ba1f0975e152971bb54cf0995a9dc3d656121aa83"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0184-lilly-owns-every-socket.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0184-lilly-owns-every-socket.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"13315189c743a8c3bbf2b813089513788c13a62f990a577b05a360ee7ec12f87"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0185-underclass-tailnet-exit-egress.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0185-underclass-tailnet-exit-egress.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"566c49f28590dc3302e3dc26bdc2954f71615641f94e04dd6a36de89d77ef143"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0186-covenant-contract-verification.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0186-covenant-contract-verification.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aabe9c9732af99626be28796a44180d3caeb5200a555a27f176de89cde6f77a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0187-detached-ingress-bridges.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0187-detached-ingress-bridges.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3c68a0698ada48d130e0e4dc9b0d5501cb5dd5afa5c78fcc4dd630905c7235"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0188-signed-overalls-cachix-substitution.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0188-signed-overalls-cachix-substitution.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"202489ffacb1baf107cf90c5fc61acf0b2d120cf7111d61ae9aac62ef4703a78"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0189-cachix-watch-store-publishing.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0189-cachix-watch-store-publishing.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"68842d1f2ab3265210b3add8d17f4edf5dd1d8449876e81272b2f28c9eea1238"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0190-native-kernel-provenance-and-admission.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0190-native-kernel-provenance-and-admission.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"576a53c9e658e535e8b7ca5d5f5d2d1e7a004a56f0677877b57e8c6c97195771"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0191-elixir-hegel-property-verification.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0191-elixir-hegel-property-verification.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb6acdea78fa591e7321f42ef5948fef9588b9458460379b4504dcacbdd013c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0192-staged-detached-ingress.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0192-staged-detached-ingress.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1ad3815c6d2f4f84750e89ced62a8b6a2854ee58d6a32311e9741a496889f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0194-marshall-http-security-headers.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0194-marshall-http-security-headers.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f424f5f8caecc523199d65233d8dbc88701e4622d225419578f1a7d85e7e4b5"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0195-user-time-zones.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0195-user-time-zones.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4618bb3420697e4ddec731ba44c047fed8b813558d47710553104418c58acaf9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0196-single-account-settings-page.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0196-single-account-settings-page.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88b497d55955e7f86d9c79585fdbabb3f967cd6bc068358c2eb014a5d3e46f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0198-git-attribution-and-guest-identity.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0198-git-attribution-and-guest-identity.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6752aec915825b77d1da42fcda76a449a83b09718e2f6641bbf340e394c159b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0199-memory-suspension-and-demand-wake.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0199-memory-suspension-and-demand-wake.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f15fba5bf0862f03fca18ae18fd1a18cbf6964e3d4f2e5a49d830e6f8a63836"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0201-localized-human-surfaces.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0201-localized-human-surfaces.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"774691bd3aa3a165b1cf00dd5f739e1d06c01d95cbb6162355177d6d4677c783"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0202-github-com-owner-integration.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0202-github-com-owner-integration.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4aff82e5bea0a0d4fc801e31c686b812f98b7fd558759bb30eaf7cf167bed7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0203-guest-reflection.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0203-guest-reflection.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f384acafc4963f8dab07f543368601e717f5da8a125df8060a7a92313d8e52"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0204-git-attribution-and-guest-identity.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0204-git-attribution-and-guest-identity.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c254fa119cbd3f96d18ba314dbbe89387626214757627d140e7f140ea152e"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0205-overview-newsletter.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0205-overview-newsletter.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60942272198ba86fe4a4c704fed3b02b4ea35388e39f9af0c9287c12a887d00"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0206-android-firecracker-guest.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0206-android-firecracker-guest.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d207ee46757d75952363eb3df7344ae32d688a4b7bc914f644161f7d4d1ef7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0207-bundled-multilingual-font-fallback.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0207-bundled-multilingual-font-fallback.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfadd4fac2c8c700d394e0c615f98653dffcba88ab66e5973e8874425c4271f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0208-windows-editor-job-custodian.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0208-windows-editor-job-custodian.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c471b92a3909e7056f98d11b3511eaf3cb2a2099b727299973997d3b3b318bc"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0220-mila-client-over-porsche-ssh.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0220-mila-client-over-porsche-ssh.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"484edf14044b3ebd381ea172811b168de8062402dc77f028bffecc0f1ae566f6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0221-canonical-app-routes.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0221-canonical-app-routes.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7106bacec2775934634b2edf126c8a08dc96dcbb769167548895de4dbfd6c21"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0222-porsche-client-commands.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0222-porsche-client-commands.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb74d6741405ae0377a7585239a31674abdc22273f901224d9fb7736abbd314d"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0223-porsche-terminal-attach.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0223-porsche-terminal-attach.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acacd1062ea4a1497548acf2c6b62c85d06bb7edd635458137dd20d6cf684cb"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0224-susan-push-relay.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0224-susan-push-relay.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c3cad88d28c8ae19b8d8fa6ad7861b9251f6831fb40402bd79fdfc88374d3f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0225-marshall-notifications-domain.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0225-marshall-notifications-domain.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b542e7f0d1c36b9eaa6b614eb89bd0a1eb150c6ea325ecb811bf81af87e7c6b5"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0226-monospace-web-on-flutter.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0226-monospace-web-on-flutter.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abf204eb81b31edfebdb0289301d51f6bb554a30115cb8de587fd7faa256181"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0228-strict-host-certificates-in-mila.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0228-strict-host-certificates-in-mila.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb54fa8026988763be817e58182c6c1c86cb60870f4f1e48d65b19f3c1be1e"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0229-scim-managed-identity-and-teams.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0229-scim-managed-identity-and-teams.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8540e2231f92a59d1d9d851df1e33f0bb1ecb6cfba94e6bf6bc610c4ae05d6"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0230-terminal-image-decoder-webassembly.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0230-terminal-image-decoder-webassembly.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"42200ef224e44baf34ba083a70147352c0a1647f49864582a7152ba48470c09b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0231-hetzner-cloud-hosts-and-susan-placement.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0231-hetzner-cloud-hosts-and-susan-placement.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ad9a064da10ebc572c5c737e2ae412f9300aceedaf7d95f34845bad71fcb2"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0233-fleet-addresses-from-sops.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0233-fleet-addresses-from-sops.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea54bf4a0c9ac1802fcaa0765a358b340efee044343cb8311a384d07e0ff45a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0234-installer-source-administrative-grant.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0234-installer-source-administrative-grant.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbce72fd7b3e965051e9b0df6699062d5f2a2f9d90abf818c7a36258497bf4f"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0235-mila-desktop-clients.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0235-mila-desktop-clients.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9047f9b9b019842c49074ad49ebd6f82e77ed196ebd70376ba0047794016e802"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0236-susan-wns-provider.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0236-susan-wns-provider.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4ea6c36ea5bbbb9193e55a032c229fc0dd631a0468af145343bcbb734d00bd"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0237-windows-custodian-same-boot-recovery.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0237-windows-custodian-same-boot-recovery.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e571d5bc3cba3276425e0f7bf3c4625568e5acd9f09dade972e5680eec748e1a"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0238-panterloons-deployment-and-per-deployment-tunnels.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0238-panterloons-deployment-and-per-deployment-tunnels.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db737cce1331e1978b0df36f4a735a5d284dfde32d0166c242fa28554d07e54"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0239-salopettes-joins-panterloons-tunnel.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0239-salopettes-joins-panterloons-tunnel.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3e893043dd9d0f7f0aabff9cc7977eeaf53941ef1972a862621d3332ce8154"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0240-account-machine-creation-presets.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0240-account-machine-creation-presets.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3399377abc7f75b499b72fbfd5eba17efef27b4dd8f789c837d1f8b16098d4"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0241-sops-tailscale-auto-join.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0241-sops-tailscale-auto-join.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca8726ec4aba4591426a142e5f6c23a8b87271f80ef8af3f350137d937ad241"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0243-native-guest-durability-verification.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0243-native-guest-durability-verification.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80a62e5799e67f97c9d56fb897066256caaa092655de0b4493e287bc8c56209"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0245-underclass-egress-node-tag.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0245-underclass-egress-node-tag.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1794d3380ba79219224c27d54dc998b87b300ba18481ca5c100e105cff9bf9d"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0246-panterloons-control-plane-deployment.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0246-panterloons-control-plane-deployment.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1dbc383b44cdb006f0dee0fcb410c2eb91132624e2f91966c69ede04c7af05"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0247-sops-operator-source-grant.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0247-sops-operator-source-grant.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6355042d454d6ec1ff19f62f0f00e3367337ba30082826bf8e9bf1bb921c439"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0248-fleet-build-scheduling.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0248-fleet-build-scheduling.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48f43cbc4dad42b382dc9433ea4f2a81553a08e3dd7185c83241b61ac930cb9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0249-mila-rust-core-native-clients.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0249-mila-rust-core-native-clients.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1a77fb5e990ebd4a9d1e474f8562d13f9ed682f8a9ef48505e8886e62b34b3"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0251-thread-owned-durable-attachments.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0251-thread-owned-durable-attachments.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9669cf08a4897e20dc1ec9de352ea913281248177ee1c783007c5502000cfa9c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0252-profile-boards-and-thread-subscriptions.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0252-profile-boards-and-thread-subscriptions.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0717703b2db891e06901cf48ef18530887e3bcf56d4326342e47cb7281cdb2fb"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0253-artifacts-domain.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0253-artifacts-domain.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd1b1f99f4d8b8a3b388fc7d0259df1935f41003bccaf4251a6eda3883c686"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0254-isolated-artifact-content-origin.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0254-isolated-artifact-content-origin.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a5495290f675460755df7533ff39fd3d5621a179dcdbb0624ae1204a6293f4"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0255-thread-lifecycle-and-server-tool-dispatch.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae53ce91c29cf22731a15736bedb3bee5ee141f1be90ef1e1f5ebb89102f80fc"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0256-batched-page-authorization-snapshots.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0256-batched-page-authorization-snapshots.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb6345db7b453f18ef65c8780f3a1c708ab87cc9215462443809ee0b4c8bc8"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0257-liveview-callback-observability.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0257-liveview-callback-observability.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4275d96d3180b4b7d8e47bd09a27f5b6775b4dc83c4b5292724577062405ee"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0258-marshall-page-service-levels.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0258-marshall-page-service-levels.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f21081a182d22c748d810c1bdff712708286afee6c4a570e26490bc5a526f7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0259-deployment-revision-telemetry.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0259-deployment-revision-telemetry.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b3baddfc9ac1e089b82eed2176bce61191d865c75fa6a5214ecdbfcbc55563"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0260-underclass-egress-without-exit-node.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0260-underclass-egress-without-exit-node.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3779353859f1baf0d2ea67853ded023019dc7fdf91db67f3a87835b39e640303"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0261-thread-feed-turn-notifications-and-subscription-revocation.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0261-thread-feed-turn-notifications-and-subscription-revocation.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a3f9cbd0ef0579c4c3e966e0512b3094e96a060e435fa252a9de0b82f9847c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0264-hermetic-mila-journey-fixture.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0264-hermetic-mila-journey-fixture.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99cdbc26ab9b3f879966074e6228d4759aea5bf361d2fdba9a3e6027d220cc"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0266-anonymous-restored-guest-memory.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0266-anonymous-restored-guest-memory.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fe7a7601141e8cf3cd5a0b2747282673527cffc8bd4e9154502f070c3418df"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0268-cedar-single-authorization-source.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0268-cedar-single-authorization-source.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eadda26d1232b20e123c3c9d4ee71d018943a09d8f3cbc381cb37d5d59c08c2"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0269-buck2-build-system-with-nix-toolchains.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0269-buck2-build-system-with-nix-toolchains.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c961dadc79c1d419b3f1985e92f1b31716ee8f6d57c183c442a45c07c32d8823"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0270-graph-driven-machine-test-selection.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0270-graph-driven-machine-test-selection.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fa81c19da0449ab96181934e051754682d7eb3b36b50bfad140a922d79a099"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0271-buck2-host-self-deployment.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0271-buck2-host-self-deployment.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba96778102f8337981709406736125e364f6582511438c7d9388e5e821f5f37c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0273-single-rust-workspace-and-toolchain.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0273-single-rust-workspace-and-toolchain.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7bd047755b352c52495de52a804b19fbb2c400420f37e5ce0d1859bf62af5c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0274-fenced-capacity-snapshots.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0274-fenced-capacity-snapshots.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"869a0c11ca621a10e2c27c4f0562a75ccdff1866a18e2dd4a73cfa5d282ccee1"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0275-bounded-control-request-execution.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0275-bounded-control-request-execution.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b941fc72a7da560b4157b364e705c7eb07fd255b2a50b95bcd023af4f92bfd9b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0276-namespace-buck2-remote-cache-and-execution.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0276-namespace-buck2-remote-cache-and-execution.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fa5a5cdf88ea9d5f6b3848eb2f68f1fcf926a30ca534d0695d90f274a262c9"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0277-mila-native-builds-on-buck2.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0277-mila-native-builds-on-buck2.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da54870a54b77522a54f46148c02af952a82a925e69bf8dce523416904de16e7"}},{"ruleId":"D25","level":"note","message":{"text":"ADR accepted but its delivery is incomplete: \u0060docs/architecture/decisions/0280-remote-underclass-and-safe-agent-retries.md:6\u0060 records the decision as \u0060Status: accepted\u0060 and its delivery as \u0060Implementation: partial\u0060: by the record\u0027s own account the code does not carry out the decision it binds. Both fields are quoted from the ADR itself: this is the repository\u0027s own statement, not an inference from the code. Finish the delivery, or record what the code does instead (a superseding decision or an amended scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/decisions/0280-remote-underclass-and-safe-agent-retries.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"778bc95819c7197068dcd4be7a093c941fb6b7a35c9307402bd7666078391dda"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c98db5bda05101194ca2297ecaa404bad973d4c7c6de6106c100ed7b74a12ab7"},"properties":{"commitSha":"5df8909ac3094eac63a95132bd44bb5997f9a606"}},{"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":"2d223a0de7df81f87af726d7100597155cdf2a652834fcd2815ba2263a1ff837"},"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":"c7d2b5eb3e2c1708dfae5c50154f46a46c36b6b5ab44435855473efa25f1098a"},"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":"76b6ce0db12f7a33349a0fb48919a729360e53f97bd753ba696525e4fad7ac2c"},"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":"89592e8e80b8a2255a1e01b84d9bc922fbb435a09727cb7452ddd378027b5e16"},"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":"719e5e5df5f65247490e8bdcea93f369f1b21028ad428368dda13c21962a4e4c"},"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":"da7a2b8bdef59a2b48aa20b8ff755e0a9b627de0e14dd59f4dfe9953c76f2b10"},"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":"959059d326deac0df8432cb9271002ad7b9bbd7150e45cf93c79170a31d8608c"},"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":"4cfe56b44ca1812ec7cce4a432a69cb4dc23bf966836758662556b63c56c571a"},"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":"719d1281c405f9a760c8bd85b702b110aaa226f17abec1f3955cce9938ead4b9"},"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":"660c02f0223a0ccfea4a64a60c52a5bdde2eec05ccb3182936497200d3523aeb"},"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":"c4e58cbb772d909bc26219dacf8fae76108bf755de979cd22b52b8d7f8ad47d0"},"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":"6149ed5a71bccf8838b67c507214a89a09aa2755b803cd78510dc4c3050ca3d7"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"add44130c85947f8a1593929c7d0542f47cdb43e4c15c1a3ec6e64e661e45c78"},"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":"06883cbd4253e585ba19d194f475dbb179046f5b873b574dfce96f70a0bc4720"},"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":"5db0da1069dab693e83f4120132d6c8d5f9285ce77261805d209870fb80b7238"},"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":"498e50e261ad3ee748d6f2dbb66aa57a077878b90135bf4c46ccd8d2b4ffd62b"},"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":"1c3318fb92c4cd55a330fbefd753e243f16db70de89b97c483b637735b199257"},"taxa":[{"id":"CWE-200","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":"52c90fdc5a7729a4e20db7d5249d6659b8a01467d18f74bf69c2345c7066dd0c"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"bf005a587fc9bbbbb5b80ec69647b0f315927b55cf8a06e376432bdcd520abd6"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ac89ea5610b2a17d840273242adc6adc486fe54abc335182753ee948bcc84759"},"taxa":[{"id":"CWE-611","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":"26bc2fcab72a3e6771149d16016b1e72404caa455c0a5bdf54378effee767573"},"taxa":[{"id":"CWE-611","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":"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":"a693c89229fda9c4eb1caa8d7df1995c744d705649a7e04b0ba389c9916e1d1f"},"taxa":[{"id":"CWE-295","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":"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":"8755eecf0c6651d525c506f96784b5a2b8b4840f3e818c0e08bbf9f368673ec4"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4632563b3393bf9a0ee8c8fa5b01efc42b5859980a5b1d4af56ea63895f75fc0"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c45943db84cf3ad732179983af14a60bab8dbcad7aa88eb629084933e62691c"},"taxa":[{"id":"CWE-295","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":"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":"97906eef7a5dca20c1ea95afd82c9dede7f1630eaefc41fa783aee3276e9ecf9"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba7584778fbf1ee7ea9c62fa8ae914c6c73c0bfe59dde9c22b24305088e5797f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"989031b6b3535d6535905613e8272a3aab4219b21170db055beef3b2dbbc67b8"},"properties":{"dependency":{"package":"org.bouncycastle:bcprov-jdk18on","version":"1.78.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"19ef8999e69e3d0e1867893b4ec324880a2ddafce4dfd4060fad9ce1d2082e1c"},"properties":{"dependency":{"package":"org.bouncycastle:bcprov-jdk18on","version":"1.79","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"eb108e8e8b862a3acbfcfa48c06cba11d68b8b5e8ee9355eda22c253450ff029"},"properties":{"dependency":{"package":"io.netty:netty-handler","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"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":"82c894726ea6662169c4a4bc08ec543ec53709a9cc75134a3b78d77d72eb8cf1"},"properties":{"dependency":{"package":"io.netty:netty-handler","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"30fd636c5b4f901c2f4677fe348cb8c41db0b5d03faf070ea926d3c17e264c5c"},"properties":{"dependency":{"package":"russh","version":"0.64.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0495"],"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":"a8c8db2498a39a82711291fa225da42bfb30d3c4be99aaddfd7763433aea210a"},"properties":{"dependency":{"package":"org.jdom:jdom2","version":"2.0.6","advisory":"[GHSA redacted]","aliases":["BIT-solr-2021-33813","[CVE redacted]"],"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":"3fa2327dc20bda09a87b61067708983e2ffde28c4fa60e5c4325fd8f6207740a"},"properties":{"dependency":{"package":"org.bitbucket.b_c:jose4j","version":"0.9.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"1c5bc19e3637053b2c1288d0b6e4e217cba82b21904c71fdc5760c2d542b9374"},"properties":{"dependency":{"package":"io.netty:netty-codec","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"a4dc7ebbc9495cd5b4832aa3764e559caafc853620ab28a49d62bcfa94674ab1"},"properties":{"dependency":{"package":"io.netty:netty-codec","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"c7665b1a34a0b7e32a9d1021a97eb87d872b1674d4ce97b4c4e420af32af7ef8"},"properties":{"dependency":{"package":"io.netty:netty-codec-http","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09420db8b81d174b2a2380dbc7ec540540fad4250c5ec5cab671b605d9459d10"},"properties":{"dependency":{"package":"io.netty:netty-codec-http","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a5c9ba0769254b337e916c728c6612d1924891f8aea59a74805b500d09295fc"},"properties":{"dependency":{"package":"io.netty:netty-codec-http2","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"2cefa7fb86d3154f5742d063a9494f47a64566afb6b53b33ac134ce0e77460e7"},"properties":{"dependency":{"package":"io.netty:netty-codec-http2","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"53886de3c8ecf400ca5ec4691966297b26b3b2949b346050f635a35d229064f4"},"properties":{"dependency":{"package":"com.google.guava:guava","version":"32.0.1-jre","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"d0ee9d39ad2a73cec98e13d6275dd51933d995972363ff51ef5b9b769eaecc17"},"properties":{"dependency":{"package":"com.google.guava:guava","version":"33.3.1-jre","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"6cc906f57426f0e073556c13e237442451cc6f3ac31ce48b3581299937217e03"},"properties":{"dependency":{"package":"undici","version":"7.30.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"dd8a4b393a1921695634ce72231f31ac51d94d317ac7f96e6ef26d95fd5282cf"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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":"d4e18286fa3bd31370c094f85a905824aed4ff2a0c9f5e9de39824df93b497b0"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.5","advisory":"RUSTSEC-2026-0387","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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.3","advisory":"RUSTSEC-2026-0385","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.36.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"525150c79769e3a8552e1d639a767bc181c181d5c769963ba9e0faa9d03741e3"},"properties":{"dependency":{"package":"opentelemetry_sdk","version":"0.31.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"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":"45f6c0dd73434ccd86356af3cc9622ade7a0e177107528134623e6a917ba7888"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.18","advisory":"RUSTSEC-2026-0523","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0524"],"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":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22995033016ae3861d571b2c92ada6244555e3aeec08bc870b909cda12b35c06"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"b99c63b86fa491be484b34be898f3f455b04a0fda0b717012d67bc5e78d9038d"},"properties":{"dependency":{"package":"tokio","version":"1.54.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0384"],"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":"f6e4a735aade751c28eab904ddb22ba138aebb078564ae40e6a88b835414a360"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"b075843246ef5738931c59bdb5596b3827346d97786334ba47d87e79136191a6"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"9948b524696a569c852df36122bd6a445f2f9796aa67689a7ca5873cc805ba98"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"2524fa115ac774a8d46eb141a635ea42b5aea7710b9782364aa9b5031e66e96a"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"e00d91631eea07f2e3d455d6ac92f34f633a0e008f10f0b55fa077c132d87c69"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"034e420a3957c17a64cee26482fa43b0570d007bd0a97b188f552bbee4312720"},"properties":{"dependency":{"package":"ash","version":"3.33.6","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c719db71a7daa218d204684dab41f2d6603a34df1a7bccde21e7332de31481f4"},"properties":{"dependency":{"package":"ecto","version":"3.14.2","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"6bf2e30d900fdbb65dac76c23cb64c95bb4fa43ab31511b6f9dbe19119964a27"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"cdce34331544215c2768e60cf17e633ee116fd2890b403d261bbdc3cd5e23881"},"properties":{"dependency":{"package":"ash","version":"3.33.6","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55065656d8b4d7f5a7a77da5db0b605eb423fba073a74505da08a781b402196c"},"properties":{"dependency":{"package":"ash_authentication","version":"5.0.0-rc.14","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99931a2c4108e7a65624dec13151a1a19808c5859ab240232ec6cb7c46c8c0e7"},"properties":{"dependency":{"package":"ash_postgres","version":"2.13.1","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","EEF-[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":"7b04c4dd06b9bf404a199f99e6533b1f8605a6b82f6a5b126e5643c3798529a7"},"properties":{"dependency":{"package":"assent","version":"0.3.1","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"bbe5bc96d8cc11ae40721f043e0b0aa7aba5a30e598d7a58ad566941884b4aa6"},"properties":{"dependency":{"package":"cloak","version":"1.1.4","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"69322c6ba7ff72f4622473a373e54decd2b88e0d493549f7014cb173d1dabfae"},"properties":{"dependency":{"package":"earmark","version":"1.4.49","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"7fc97c449c68dffc05068f6cb03071e78b3fcb5d95d067223db630474b7703ec"},"properties":{"dependency":{"package":"ecto","version":"3.14.2","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"42c43a1774335cb0c0d461ddde688b54d9e01e76091101bb050b909f284df4ea"},"properties":{"dependency":{"package":"phoenix_html","version":"4.3.0","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"5c2e5ea3e97c9b21a65dec6740b7d6b39315017430e0a66dc01f209cb0d4181a"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"fc903bcc305b6600e8f27301dc92cb75eb3712daa46e3712a72a9c142744246f"},"properties":{"dependency":{"package":"io.netty:netty-common","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"afb5746d92d1cd2b5402c09045af60b25a81b349f024a3bff38772df474e912b"},"properties":{"dependency":{"package":"io.netty:netty-common","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"a7e4cc5d68ba7a4c2c18b47d98ee3246f279655bef34344f31e1590a5779f3bb"},"properties":{"dependency":{"package":"org.apache.httpcomponents:httpclient","version":"4.5.6","advisory":"[GHSA redacted]","aliases":["[CVE 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":"be6ba79d9267e36ce17e818b874a4903d8f3a076836e881d793fab96c858dd45"},"properties":{"dependency":{"package":"org.json:json","version":"20250517","advisory":"[GHSA redacted]","aliases":["[CVE 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":"b907dc68ee3525f532cd86072b24f6fb9ef91fbd18099de623ec641482a3bcf9"},"properties":{"dependency":{"package":"org.apache.commons:commons-lang3","version":"3.16.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"3edfa4527917e8d176c7b727d8e34b22375ff4c67fc5ebd69e2ff4155f77a095"},"properties":{"dependency":{"package":"org.jetbrains.kotlin:kotlin-gradle-plugin","version":"2.2.10","advisory":"[GHSA redacted]","aliases":["[CVE 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":"8f2f3911fc690f4e67228d9b034089c590f096618ec6deb8c1e02130ef425829"},"properties":{"dependency":{"package":"org.jetbrains.kotlin:kotlin-gradle-plugin","version":"2.4.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"b8d3d2c491fe229dbbc9eedaa1e23b2e339f658aad06ce81d7ec1a068acfcf23"},"properties":{"dependency":{"package":"org.bouncycastle:bcpkix-jdk18on","version":"1.79","advisory":"[GHSA redacted]","aliases":["[CVE 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":"415e355a3e318ae9635de7caa5c3354dd761cc4e5d5af177e17e0213fcca46d5"},"properties":{"dependency":{"package":"stdlib","version":"1.25.0","advisory":"GO-2025-3955","aliases":["BIT-golang-2025-47910","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"nix/domains/artifacts/guest/github/transport/transport.go","line":161,"symbol":"url.ParseQuery"}}}},{"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":"21e8833a5834103a45fb95a3d7afd12d76014534541565735fef4e475a47e714"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"1be22a1471c45fb0213962c7a67afbcf82dedacfc1e80aa262015c14ae181f0e"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"4c49efff268b16a3a6a631a399e0a512ad22e3f7d2b1aa0cc8df9106cdd414b7"},"properties":{"dependency":{"package":"ash","version":"3.33.6","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","EEF-[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f996d08ab7063d436d5102afb7f153d7903f1b6d025b392ce6dd10a4734ca9de"},"properties":{"dependency":{"package":"ash_postgres","version":"2.13.1","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[CVE redacted]","EEF-[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":"bce508ac15fa28a29bdb2d6766f45913a98529138b32b2416efbdb0beb465aaf"},"properties":{"dependency":{"package":"ecto","version":"3.14.2","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"01683d293eb5c7ffcb4d11a1223a82ba1f9e0b0414e1be80f65c727a5ab68777"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"0229f7b169ecca1928e94afc48b6cfe248e0a4b68692880b58eac44dba06791f"},"properties":{"dependency":{"package":"ssl_verify_fun","version":"1.1.7","advisory":"EEF-[CVE redacted]","aliases":["[CVE 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":"e37c11004f4f2ce3de08fcf00b3e6c702c7f0b8e027200dd01e974d77a3e9e30"},"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":"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":"11afb2f87b9db9e432294a47cffa65aec9bb969dfe520b067765ef5eed170e6a"},"properties":{"dependency":{"package":"pageant","version":"0.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b2fef8c6b3c0c01739f79e6852a503582593e061e30f1abaf2db3c047271c814"},"properties":{"dependency":{"package":"io.netty:netty-handler-proxy","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"8098cdcdcc6478d167d21bf781a887a73c87577684c190590c4122cbea167639"},"properties":{"dependency":{"package":"io.netty:netty-handler-proxy","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d9f3c2c8d76066829c8de5246de95a414449e1f5ad7345431d03716a816ec4de"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"35bd835fcf003cf3a7b49b86bdff9a197a4b7f04ac962e67f6482102c80b3d29"}},{"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":"e407fcda038ad5ca754cad5be3ebd0be3ba7d8219212c8200b695d5890817910"}},{"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":"4b03dfd19a0262d3e6ff1e33431f292ec4d6be88ee2462fefb66aaaa8520049e"},"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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: MilaStrings: \u0060MilaStrings\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (Catalog; e.g. \u0060Catalog\u0060 at line 22). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MilaStrings.cs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ede2d74fb8aa9638cc4c6900016baf9a5e2d6f3743227365078863fcac7ac6"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by imperative guard methods that throw on violation) \u2014 this is NOT a claim that the code is unprotected. What\u0027s missing is a NAMED rule set: the guards encode the access rules inline, so the rules can\u0027t be listed, reviewed or tested apart from the call sites that apply them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"DM1","level":"error","message":{"text":"Aggregate holds a reference to another aggregate: Hmac.inner: \u0060Hmac\u0060 references the aggregate root \u0060Sha256\u0060 directly (via \u0060inner\u0060) \u2014 hold its \u0060Sha256Id\u0060 instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/crypto.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b012eb71beb44c2d8a8025f9a4a84fc3baae3d5b11ddd2b3f70d269c01ddc2d"}},{"ruleId":"DM1","level":"error","message":{"text":"Aggregate holds a reference to another aggregate: Hmac.outer: \u0060Hmac\u0060 references the aggregate root \u0060Sha256\u0060 directly (via \u0060outer\u0060) \u2014 hold its \u0060Sha256Id\u0060 instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/terminald/src/crypto.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab684a09eeb9336681efe36333ba3f3e06747492b122d7607df0a0dddd4a919"}},{"ruleId":"DM1","level":"error","message":{"text":"Aggregate holds a reference to another aggregate: IntakeLimit.host: \u0060IntakeLimit\u0060 references the aggregate root \u0060Window\u0060 directly (via \u0060host\u0060) \u2014 hold its \u0060WindowId\u0060 instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/intake.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21af273d834cae85af6ed1f21832a41eeb5dc6948b7b249e2f02d97c9efefb"}},{"ruleId":"DM1","level":"error","message":{"text":"Aggregate holds a reference to another aggregate: Runtime.store: \u0060Runtime\u0060 references the aggregate root \u0060Store\u0060 directly (via \u0060store\u0060) \u2014 hold its \u0060StoreId\u0060 instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/request_recorder.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85cdc79d3302b70086655501b9177613c263e09308d7e967392e0864ffacdd1"}},{"ruleId":"DM4","level":"warning","message":{"text":"Anemic entity: Runtime: \u0060Runtime\u0060 is an aggregate/entity with 3 data propert(ies) but no state-changing behaviour (only data and queries) \u2014 the business logic lives in a service."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/otel-guest/receiver/src/request_recorder.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f8053c3c07c5675cf0600ae9435af356a2fe3522e1626386f6e86a9c6c82cc"}},{"ruleId":"ED3","level":"note","message":{"text":"Event not named in past tense: UpdateRolledBack: \u0060UpdateRolledBack\u0060 is an imperative name inside a domain-event set whose siblings are past-tense facts \u2014 it reads as an intent, not something that happened. Name new events for the fact that occurred (e.g. \u0060ItemAdded\u0060). Do not rename this one if it is already stored or published: its type name is written with every event recorded under it, so a rename can break replay of the stored stream and every subscriber that reads it, and a clearer name does not pay for that. If it has never been written or sent, renaming it now is safe."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/log.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11be39c870088c3caa5cab6e0ad2b8e9de79cd2fc07e8249ddbbc8391d8ceb4"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060audi/README.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060audi-private\u0060, \u0060porsche\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"37135dfdedde06667617f67b5dc61f91200ed5a24fa85c514f5cdd78747e0723"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060galileo/README.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060ziggy\u0060, \u0060porsche\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1887ee5a5745681d01518315bb8bce17978b124485869066e9b0c73b19a831"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060protocol/README.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060peach\u0060, \u0060susan\u0060, \u0060audi-private\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacbd56a5b61ecb4753b32c2e19e4a95b9b7fa8d1c00786c7acb9b1edce66e4f"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060ziggy/README.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060galileo\u0060, \u0060porsche\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/README.md"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1403f87c72ca210f9ec0fbe1ceafc965e0b3057fc69721e3aaf6c5e68072ea"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060antithesis/scratchbook/sut-analysis.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060peach\u0060, \u0060protocol\u0060, \u0060susan\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/scratchbook/sut-analysis.md"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"826a7b7efc7efc215ab4147ec13c72ae9b3636e88889a5afd7f747dfc1a9ead8"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060antithesis/scratchbook/discovery/focus-01-architecture.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060peach\u0060, \u0060protocol\u0060, \u0060susan\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/scratchbook/discovery/focus-01-architecture.md"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a004976aa8d13f7c3d6f204aa4adb43a28480af6b4553ad18b3bd1d2dc3ff842"}},{"ruleId":"P10","level":"note","message":{"text":"No explicit versioning: No explicit version was found for the SwiftPM library declared by \u0060Package.swift\u0060. This check read nothing in Package.swift, which has no version field, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library\u0027s directory or at the repository root, or a semver release tag (or a Drupal \u00608.x-1.2\u0060 release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Package.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1613d200c956e18c3dd25b2366684ddda8ac327528b946be55f835e4b1f2c42f"}},{"ruleId":"P10","level":"note","message":{"text":"No explicit versioning: No explicit version was found for the Go module library declared by \u0060go.mod\u0060. This check read a \u0060/vN\u0060 major-version suffix on the go.mod module path, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library\u0027s directory or at the repository root, or a semver release tag (or a Drupal \u00608.x-1.2\u0060 release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/github/transport/go.mod"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce9ca938bb5d7d46fd70b442f29cadc852ad3cdc093eed2034f40e1e4813ce"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 5/33 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060antithesis/fixtures\u0060, \u0060antithesis/integration\u0060, \u0060elixir/diagnostics/native/spool\u0060, \u0060enrico\u0060 and 23 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch github-actions/nuget/npm/cargo/gomod/pip/gradle: \u0060vendor/ash_scim/.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060github-actions\u0060, \u0060nuget\u0060, \u0060npm\u0060, \u0060cargo\u0060, \u0060gomod\u0060, \u0060pip\u0060, \u0060gradle\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/ash_scim/.github/dependabot.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e746511dcf5b081aa482040564a8f859d49a049feeac21f2d381683f04bebe52"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: 26 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) \u2014 these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2dedb76432d7d4f359386b5c37564c0f3de368182a77e31aa8af9ba73f9a4def"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/JourneySmoke.cs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a84f127466c53647fe04cc2772b53c29bb91df3e618c569b811f6261a0ce2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"30199fb1c28024a9e10535943c579aa822933c07b60a4bc7fa4f4f8f4b79aa02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78cacc2f38d86fd382106389c74d30a9cbdcac103a1bf0ec6b69d5f14cfb7af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e03db60658766ca5e5bb6572e91e42d1aa047e3e2107142cd307be666815ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d712316d6ec6e07d122177b4ff26547fdfd90ad89de3e8517b943b8f960d2fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f17ebe0a948209409c654901e20cb58120083d92769887c796627c7bb78dd7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a677c1a6a3d3e77e6fde833b83b053d3e68e60454b5913694e7aaa68f30af63"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4fb8abc43d8829244fff87ff3b09d5adfa4b76c05d730ce875812258f5344d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7048ccaca643f3bf272b0e3f722aa32a81299cf9186a4c6236f4d91312f633"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e32f031f2cbd11763a08a4c1c67ed9de9bbcb0707d7f37d7a9794452bc8f8e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a479e376a08174e71fff9f200cce5051d481b86b34cb7bfe79d31acfa4a6903"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8869f3346d4efe416d2cb3090ea135a7fa83944d433ca1d83db34c363ae537"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca8707257e70cfc4936642c23b1ded544805ab6ebae68d07a144177b8f8d36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe93b51fe1b9b96afdf213cf288c6732d8798915eec381166c96ac9eaf2950e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/LifecycleSmoke.cs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e301a4322c8d99c577df4e40fb4c84c45b291d2551f715ec854f1d0834307"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/SessionLifecycleSmoke.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"562479cec06984578ed7a634c2d82c9ea6d055369ce3bb66603a5e785907b529"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a3174f7b443eb2516c7048d664b5f88399c0e8832678c302540f70d64dbee4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"025920a7777e7a99eb475c37c8c98a6a41614e072aa956e4f577a6638c5063a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"656e61b691ffc9b69ca2c951380c400d32cf0411eb89ce8665eac0ae490cdeb9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/ThreadGenerationSmoke.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74bc6e71a334f90653427f3b5c64fce5eef7b72146b1b809f07fa96f0160eb8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/WindowsNotificationsSmoke.cs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc02299112cae43594b295811c36874fe488175fadd5e0a24e402a025250d99"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/WindowsNotificationsSmoke.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"51de77b542d801e0585d6e55a1f123a4ad3d43ec82d2a22a227348602db13e25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/WindowsNotificationsSmoke.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f29a0c816a3cf00fb643ef17d5454305a981dc9d090d7782fc354e0fa40b8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-uia/LoopbackTrustListener.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e435bc507b2f89bbb4348f82b0e02729804b99a100a35feefd895cda4f7b4dd2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-uia/PickerJourney.cs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aeb0fe90904257aa029d0c8ccdd87b568471d3f16a05fe46debf4e95f80d1e"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 33 typed \u00B7 17 plain JS \u2014 the untyped files are buck/probes/esbuild/entry.mjs, buck/probes/esbuild/greeting.mjs, marshall/assets/js/android_display.js, marshall/assets/js/android_display_hook.js, marshall/assets/js/app.js, marshall/assets/js/dashboard.js (\u002B11 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): marvin/scripts/build.mjs:14 \u00B7 marvin/scripts/package.mjs:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"marvin/scripts/build.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead42ac3f9b7f96a544dd5ef41171145bd1c45bc3694339c24cb2bae8ec27b3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/check_contracts.mjs:116 \u00B7 scripts/check_contracts.mjs:126 \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/check_contracts.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b35b206cc61304b1edb48b2301f691ddc18de3fb45c319736a64a0890106d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): marvin/scripts/chromium-smoke.mjs:65 \u00B7 marvin/scripts/chromium-smoke.mjs:90 \u2014 the two spans are one implementation copied and then locally edited \u2014 150 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":"marvin/scripts/chromium-smoke.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a7f96bbcbdad60da5077bbad501332059e9e659e93fc4ca7283bb27df3db5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 114, cognitive 187): (anonymous) has cyclomatic complexity 114 and cognitive complexity 187; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"feda8278ba78ba23a3aa462cfa209e1555337e72dae895696de0b4479b2f6e7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 45): (anonymous) has cyclomatic complexity 29 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"marshall/assets/js/terminals.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae29da3eeb2f6ec2df17fd81db5fad3fdf08dfd3038b879562dfae38f483df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 37): (anonymous) has cyclomatic complexity 29 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f0f62cf6aa097fea11086500112f07524747f6edacb939da773a943a55c7d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 32): (anonymous) has cyclomatic complexity 29 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/thread_composer.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f982ca5e2a4ff874a0db082231c3674081c898de912400106e3d79bed74fa500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 25, cognitive 23): main has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"nix/domains/artifacts/vscode-web/check-extension.mts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2cf621f9e0dab2a5cf6373241d812ef5b4f412ed3e64d9db7c6d26dfbb394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInputs (cyclomatic 25, cognitive 17): parseInputs has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"nix/domains/artifacts/vscode-web/check-patches.mts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fadad84405a998ffb512d1c0c70e044c4affacd9210e60369a3ee4712cc326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRequest (cyclomatic 23, cognitive 19): parseRequest has cyclomatic complexity 23 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/artifact_frame.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d84d6eaf886280acbcaa8fa90e7427da16cb722e6bec5c3dcf3d7f4afd73643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 19, cognitive 23): verify has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/admin_elevation.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c5bac52f54c3258878be7eb34ddb86466d2cf605b1b0e1574bb01975699f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verificationChallenge (cyclomatic 18, cognitive 12): verificationChallenge has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/admin_elevation.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea454c7cdde861ef631ccbcb806b451022f7a76a8fe6d71b7e2101e6fd485338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 18): main has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_contracts.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"594e39c0faf8407e097ec80ee65bcc9048e74cb7917c334ea7fc7ddcb20e9c63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 12): (anonymous) has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/thread_composer.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"410eac7e5a2c82ac7875ec0cb1a16428ab6b0e28353db940524cf2d93a31c8c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFiles (cyclomatic 15, cognitive 24): checkFiles has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_contracts.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e86d99fe6d269b088fbf12a59a08cb9e1700815a10dc78aa27d0fb15a519b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSessions (cyclomatic 15, cognitive 19): renderSessions has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c97e36d06056a1b8aafa4c3a850ce4450dbd7cc8231a9df0c5c97e8b46f73be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureRepositoryLaunch (cyclomatic 15, cognitive 15): captureRepositoryLaunch has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/repository_launch.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba49821c81a57669ff5578b6a869063480241853f540be4354c4501f7188651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNativeNotes (cyclomatic 14, cognitive 26): extractNativeNotes has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_contracts.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b356e339c80eb8679799941d1245fe429eec75e33e34c782cbe21ac210dd16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isAccountService (cyclomatic 14, cognitive 13): isAccountService has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/check-no-account.mts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d868f96e35a6c0c2c741ae4579dafae28785ad9efc96080565a6653411e91d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 13, cognitive 20): prepare has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/prepare-windows.mts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ae52cf41da2c65997a47d1eedad20b1f7c7038a6d47bff65edebc73370c332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleControl (cyclomatic 13, cognitive 18): handleControl has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a40ec30371540e9a312821fc287460f116241920cfe97fc6ee303506c432e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function select (cyclomatic 13, cognitive 16): select has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"36feb496793cff49b386db8e451b0c841235417c92a997bcc2ce908aab532091"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/verification/tests/machines/windows-editor/extension.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1af112500d6a3b5f91ca53f4786a2c6d632fb9228bea62776f28ca48b3792f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function offGridElements (cyclomatic 12, cognitive 15): offGridElements has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/grid.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a973025b7ff6caa4922dea19f627b26a7c5b77a71ca788379fefd7826f57932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0919889fd9c30d85b105de159cf3ecb5df831ce45c83c7790fa403d823cc84c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e73104d28eebc1914bfb112309d97b7f4683802257581f7bc420cad5c91e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function click (cyclomatic 11, cognitive 12): click has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/passkey.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"489a3ea30f098835659bceae231f52c0c3a6fd7a487cfa78c6a0cb6cf3f9ba8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readClipboard (cyclomatic 11, cognitive 10): readClipboard has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/assets/js/terminals.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef0a3b4f3818ea39948585dc5cba69d4271fd4b093084915c051bc76868c49"}},{"ruleId":"R3","level":"warning","message":{"text":"marshall/assets/js/terminals.js: 1178 lines of code: marshall/assets/js/terminals.js has 1178 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":"marshall/assets/js/terminals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb4a5dd6a778a6cc2dda84d0ca4c92a9b68c8b553ba6ed44e176648601b915"}},{"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":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfff02d39315f071cf7e72769cf4f490064259927dd909de9fb76e59402b8b48"}},{"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":"nix/domains/artifacts/vscode-web/check-runtime.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f73849397c3cf0822404b07ff581c37ce514792c4d7c9268e6e9407227b8f5c"}},{"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":"nix/domains/artifacts/vscode-web/prepare-windows.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228dcf90c2171b86a5f8c5691f0789fb0154b5a45f0489f0bdeb155e3e7719c6"}},{"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":"nix/domains/artifacts/vscode-web/check-bundled-updates.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420ed471ba46eeeddc14ee8c57da3732b089350f14bd5e1b861a9989a4f472e"}},{"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":"nix/domains/artifacts/vscode-web/check-patches.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4879ee054ba2790f3de4c6f3f9daf9170c0f59b7d8f2d08c8c3f763a175b6d0b"}},{"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":"nix/domains/artifacts/vscode-web/check-extension.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a11900e5a84d0afa11b6a9fd50a81880b862ce59c0ef6557364e8c509ca225"}},{"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":"nix/domains/artifacts/vscode-web/check-no-account.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a7a873a911b598593dda89db7521f2c7506061bee6d3e681399cb5ed25079b"}},{"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":"nix/domains/artifacts/vscode-web/check-policy.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1172dfc1c84a139b78749f3d9a34559f3b6b257021d3e036176dcfd9d536b4af"}},{"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":"nix/domains/artifacts/vscode-web/maintenance-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d8bdc1c2b5ab70da8ee4d8ca9059da58e1a38507404c899e545e1706b4b69c"}},{"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":"buck/probes/esbuild/entry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34bcdd375242587d4e24d0d59b5321c984afa68dff37531f55ebce2407748ff"}},{"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":"marvin/common/background.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b38aa0ec5b23f17f89140da5abfd3105719293953a721433ad121ec248b641"}},{"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":"buck/probes/esbuild/greeting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f71ef05f849ae595684c9d53e7b71ddc1ef4ff680b2cb8c5c4fce67516c99c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/prepare-windows.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ed15161090ae47b49bd607d3fa72a30c13a2f6479384c274effd5333007b6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/check-extension.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c1826d1eb7596681b6e736d44169dd83e4adf55dc5d0affb9fc865baf4a36"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web/maintenance-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"285722c8f176decf28ef171505eb42d675d1f58145ceaf23ac75770a18c23551"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"buck/probes/esbuild/entry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549d4b99f5cf6c538cd30f6e285e8ef9ecde330fb46f449035e81567e1bb6831"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marvin/common/background.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce611113d598c94265562c9fa94106eeb4d4eaca5e5c94f912d45ed1484fd992"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (38 application, 2 tooling, 16 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (buck/probes/esbuild/entry.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"buck/probes/esbuild/greeting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d9f53d6bce7d7793a480436c2b265d5a2d6271cf8b3489b3c0e9dc9c1a6e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027setPref\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":"marshall/assets/js/terminals.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e4ee7931f29734f48aabf784a8311f3a61b5272ab5c4a2b36304981272ceae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!result.Succeeded || result.Data is not { } bytes\u0060 appears character-identically in 3 files \u2014 mila/windows-dotnet/Interop/RustNativeLifecycle.cs, mila/windows-dotnet/Interop/SessionListing.cs, mila/windows-dotnet/MainWindow.xaml.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"06524df3a05da6f830ccb452c924fc93f56de4232146ac924451f5e29f44670c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!result.Succeeded || result.Data is null\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/RustNativeLifecycle.cs, mila/windows-dotnet/MainWindow.xaml.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2910b705293725605c0b11ecba6889894a0b26c6f164e40ce9e2b02d11418918"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Status == MilaNativeStatus.Ok \u0026\u0026 Data is not null\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/Interop/RustNativeLifecycle.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba40e320d8327affc3b1089c0c55c4bb93e93091264cb4e4246a7430634ffb85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060channelUri.Contains(\u0027\\0\u0027) || appId.Contains(\u0027\\0\u0027) || deployment.Contains(\u0027\\0\u0027)\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/Interop/RustNativeLifecycle.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d97805fd8a01186a7f6187cc7276ba263d7ccad5e044f185d41d79cc5003718"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char.IsAsciiLetterOrDigit(c) || c is \u0027-\u0027 or \u0027_\u0027\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/MainWindow.xaml.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62898e2bd7775c9e24f4f6745a3a97b0b61c5d449172d471ac841fa88883299"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(user \u0026\u0026 is_nil(user.deleted_at)) and user.active\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/accounts/administrators.ex, marshall/lib/marshall/accounts/security.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/administrators.ex"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"55393b611607c2fbe91c658cd7c3c741d4f4f564e9492d6c42fda0424a784b7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060:inet_dns.dns_query(question, :domain) == String.to_charlist(owner) and :inet_dns.dns_query(question, :type) == :txt and :inet_dns.dns_query\u2026\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/inception/propagation.ex, marshall/lib/marshall/ingress/acme/propagation.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce96651bfb58bfa1548622f7ac14f91e9ddbfa0f35af67d461539db0a0f9123"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ash.read_one!(query, actor: SystemActor.compute()) || Ledger.rollback(:forbidden)\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/access/authorization.ex, marshall/lib/marshall/compute/lifecycle.ex, marshall/lib/marshall/compute/resize.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/authorization.ex"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b8917c0fee9178d313d52347e9cc3c5422d91402861b35846656653add7a9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Audi.Authority.Renewal.inconclusive?(result) and grant.expires_at \u003E now()\u0060 appears character-identically in 2 files \u2014 audi/lib/audi/http/authority.ex, audi/lib/audi/inception/authority.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/authority.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a10bb04065082f5c21f4d580eb2d5ae32d69534f2e50e6dfca851d02da6aad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060DecisionSnapshot.active?() and vms != []\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/access/authorization.ex, marshall/lib/marshall/compute/views.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/access/authorization.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b41d8b60d21b1dd0877f80b84769cc70bd65b8664365de24f613f70df8b659"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exists?(Path.join(root, \u0022flake.nix\u0022)) || fail(\u0022run from the repository root\u0022)\u0060 appears character-identically in 3 files \u2014 scripts/cargo_security_upgrades.exs, scripts/fetch_pins.exs, scripts/mix_security_upgrades.exs. It is one line, so the duplication detector\u0027s token 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/cargo_security_upgrades.exs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb68359b4e3b041f66bb1dc9c555758b174a2415342df1e3de6aaedf861cc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Keyword.keyword?(values) and length(values) == length(Enum.uniq(Keyword.keys(values)))\u0060 appears character-identically in 2 files \u2014 elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, elixir/diagnostics/lib/overalls/diagnostics/metrics.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0d271e94d8d98ba995046b252ae796ea1cad73dcd211b789c941a1f45829ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(AdminBootstrap, \u0022installation\u0022) || Ledger.rollback(:forbidden)\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/accounts/account_lifecycle.ex, marshall/lib/marshall/accounts/admin_users.ex, marshall/lib/marshall/accounts/administrators.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/accounts/account_lifecycle.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad928c142cd302091d48a0629b75c552573515cb3ff59590b1a2850ba390c29c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(Artifact, artifact_id) || Ledger.rollback(:not_found)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/artifacts/sharing.ex, marshall/lib/marshall/artifacts/storage.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/artifacts/sharing.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"13eff77e7359ae7a4b8f568b131d88cbf369265d24e63670578473b2614707a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(Thread, turn.thread_id) || Ledger.rollback(:not_found)\u0060 appears character-identically in 4 files \u2014 marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/skill_maintenance.ex, marshall/lib/marshall/agents/turn_coordinator.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b09e7f3338a7e0cfa54c42675caaedae6c8c21ed30223be59bced06e9a85a74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(Turn, turn_id) || Ledger.rollback(:not_found)\u0060 appears character-identically in 4 files \u2014 marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/skill_maintenance.ex, marshall/lib/marshall/agents/turn_coordinator.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6e8e91630d22628c6c321ad22d648232dbecb01faf2771618f19ac41241067"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(VirtualMachine, request.vm_id) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/editor/authority.ex, marshall/lib/marshall/ingress/execution.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f0b3da28609906ab706eb4f9d393e05e6ab85c8bb6deeca472178d4190318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(VirtualMachine, root.vm_id) || Ledger.rollback(:machine_unavailable)\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/web_search.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d1aac639863f243763ce54421250cc8572b34ae101847d396fcf59334de19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock!(VirtualMachine, session.vm_id) || Ledger.rollback(:unknown_session)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/terminal/sharing.ex, marshall/lib/marshall/terminal/termination.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/sharing.ex"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"020fbc74d965cc88cb61b862c69aebccfdc2a8e1a8e531ebbd0c553717cbce80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.lock_history!(Thread, thread.id) || Ledger.rollback(:not_found)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/threads/activity.ex, marshall/lib/marshall/threads/coordinator.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads/activity.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e39187b6fe3ff1c8c80de1b8dbfcc47a3b214c9694bf7723ece37da414e8b94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Ledger.share_host!(id) || Ledger.rollback(:unauthorized)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/galileo/credentials.ex, marshall/lib/marshall/peach/credentials.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf134340fec57c2a0c31bf6b61b501dab26f82f93539031ef81d4bed4d777476"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(Endpoint, label: label)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/open.ex, marshall/lib/marshall/ingress/routes.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/open.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75ffdd560524cb5b264dbd573e5d3cdf09e46dd46b1aba56837173e66282338"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(Endpoint, label: request.label)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/sessions.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/sessions.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6316733ba2ca72bce9b2ada0b3e2f885a11214628c5afaea540a92034adbe7f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(Endpoint, vm_id: vm.id)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/routes.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/routes.ex"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04002d5a495985c2a0806aa7ce452bc9e061b5287b82a5e947fe5e8654c7f5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(Environment, label: request.label)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/environment_discovery.ex, marshall/lib/marshall/ingress/environment_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/environment_discovery.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"51557d4b29affdba244c8532087d7278355dcee80e150343b6d5008ecc17a561"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(VirtualMachine, id: environment.vm_id)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/environment_discovery.ex, marshall/lib/marshall/ingress/environment_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/environment_discovery.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bda8487ce42b9598d0cfc971896b044992bc1825c06f358c881267ad41bddc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060List.first(Ledger.read!(VirtualMachine, id: id)) || deny!()\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/execution.ex, marshall/lib/marshall/ingress/open.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce301540701bc6d5256b787bdc586b9ad0331195aa829308423de1b844acdea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Mix.env() == :test and System.get_env(\u0022OVERALLS_BOOT_PROBE\u0022) == \u0022test\u0022\u0060 appears character-identically in 8 files \u2014 audi/scripts/invalid_boot_probe.exs, brady/scripts/invalid_boot_probe.exs, enrico/scripts/invalid_boot_probe.exs, galileo/scripts/invalid_boot_probe.exs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/scripts/invalid_boot_probe.exs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20591c42547135e58fa9068d8070ab950dc804cab1d2a4ef4a5a1112932c3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060OverallsProtocol.uuid?(host) and OverallsProtocol.uuid?(placement)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/network/flow_label.ex, lilly/lib/lilly/terminal/metrics.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network/flow_label.ex"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2be48a825f7253d63f837f65325ea64e49add19639e1fbe008d0afec89aefc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060OverallsProtocol.uuid?(vm_id) and OverallsProtocol.uuid?(placement_id)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/vm/actor.ex, lilly/lib/lilly/vm/driver.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/actor.ex"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"163a73e12743ff4135a4111ea6fa4590a9deb0a4dd59fc7e7e7b824bbaa93de9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Path.type(value) == :absolute and Path.expand(value) == value and not String.starts_with?(value, \u0022/nix/store/\u0022)\u0060 appears character-identically in 3 files \u2014 galileo/lib/galileo/config.ex, peach/lib/peach/config.ex, ziggy/lib/ziggy/config.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/config.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f377eb7643a316c0221db2cd1dcbe1e571a22dc4ef61ee89b5a0d51bee2ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Regex.match?(~r/\\A[1-9][0-9]*\\z/, value) and String.to_integer(value) \u003C= 18_446_744_073_709_551_615\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/host/zfs.ex, lilly/lib/lilly/host/zfs_dataset.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229c52dd9862e6eeff9990a39d9b63ae0febde90ee7b169517872cd5d4a13ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060System.find_executable(\u0022mix\u0022) || Mix.raise(\u0022cannot find the \u0060mix\u0060 executable on PATH\u0022)\u0060 appears character-identically in 2 files \u2014 marshall/mix.exs, porsche/mix.exs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/mix.exs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07e9d2925a2a9acb1f8656727cf3128cfc3fdb34c5237d2862b8a16806344c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060System.get_env(\u0022MARSHALL_INSTANCE_ID\u0022) != \u0022enrollment-operator\u0022 or Application.get_env(:marshall, :operator_mode) != true or not File.regula\u2026\u0060 appears character-identically in 3 files \u2014 antithesis/operator/fixture.ex, antithesis/operator/integrations.ex, antithesis/operator/terminal.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/fixture.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a59528d5c2be0913e135e3a187fc29cd1927845a071ac1322170d071dd1d832"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060active?(credential, host, now) and Plug.Crypto.secure_compare(credential.secret_hash, :crypto.hash(:sha256, secret))\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/galileo/credentials.ex, marshall/lib/marshall/inference/credentials.ex, marshall/lib/marshall/peach/credentials.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d3db467e62059197a98840251143af864552b16726d152c484a110eae0bd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte_size(value) \u003C= 2048 and String.valid?(value)\u0060 appears character-identically in 2 files \u2014 porsche/lib/porsche/ssh/onboarding.ex, protocol/lib/overalls_protocol/ssh_onboarding.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bccee8d98156a25a67f4cc159fd6490fb8518ed147ff03ca076e684e3cf51b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flags.supervisor_attempted or Keyword.get(options, :name) == Porsche.Supervisor\u0060 appears character-identically in 2 files \u2014 porsche/scripts/host_certificate_boot_probe.exs, porsche/scripts/invalid_boot_probe.exs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/scripts/host_certificate_boot_probe.exs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"06486b5b2d522cd3a0eb6a45c645cc92088becee321ed6a0127aff695734b97c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grant.revision == previous.revision and grant.expires_at == previous.expires_at\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/clone/effects.ex, lilly/lib/lilly/transfer/source_export.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac6fc693a88f2f4fa3b569151a7510400d3177bfb3ab733976893f2004f6f31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grant.revision \u003E previous.revision and grant.expires_at \u003E= previous.expires_at\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/clone/effects.ex, lilly/lib/lilly/transfer/source_export.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/clone/effects.ex"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39148feadebd194611737a32bde2b4829699016d3ba9af94859749585e26bef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.enabled and is_nil(credential.revoked_at) and DateTime.compare(credential.expires_at, now) == :gt\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/galileo/credentials.ex, marshall/lib/marshall/inference/credentials.ex, marshall/lib/marshall/peach/credentials.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae248b7cf6a6ae473cdc63ceac13bebad4dfbfe7e314197a3e5aa18ed6edabe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_atom(reason) and not is_nil(reason) and not is_boolean(reason)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/vm/driver.ex, lilly/lib/lilly/vm/executor.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e52d5d5fead4cd52b5ddb16b5bde5a28e52929ff52f30daf72407715e54086f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_atom(reason) and reason != :unauthorized\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_receives.ex, marshall/lib/marshall/compute/relocation_sources.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6fa71a0e46356ea6507076483f4868ef5f1867af1870fa66d65f0daad0bbf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_atom(value) and value != nil and Overalls.Diagnostics.Schema.enum?(value)\u0060 appears character-identically in 2 files \u2014 elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, elixir/diagnostics/lib/overalls/diagnostics/metrics.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"985edb3ff940b189232de0dd0143f63921d97dfb6a85ddf9b6899890865287dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(body) and byte_size(body) \u003C= 65_536\u0060 appears character-identically in 2 files \u2014 antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex, marshall/lib/marshall/github/provider.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/integrated_ownership.ex"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ae541f72cde35ac8c10646785c1ac31ddd7b01ce940d36c9a18bf582fc603"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(body) and byte_size(body) \u003C= @max_body\u0060 appears character-identically in 2 files \u2014 protocol/lib/overalls_protocol.ex, susan/lib/susan/poke/request.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3400da717450a8dbc880d69ad26023d89875caa574a3e5e2f8e142622e4a665"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(bytes) and byte_size(bytes) \u003C= @maximum\u0060 appears character-identically in 4 files \u2014 protocol/lib/overalls_protocol/editor_connect.ex, protocol/lib/overalls_protocol/inception_exchange.ex, protocol/lib/overalls_protocol/ingress_connect.ex, protocol/lib/overalls_protocol/ingress_relay.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_connect.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c18105393f150778b7bd798b252279f2f3096703a8082c30d800105e5230984"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(command) and byte_size(command) \u003C= 96\u0060 appears character-identically in 2 files \u2014 audi/lib/audi/ssh/channel.ex, protocol/lib/overalls_protocol/inception_name.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/channel.ex"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"412792aafeb318639ff113b409a212e31998477e0bfdbca56d9994ac3e0b9f9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(integration.owner_id) and integration.owner_id == target.owner_id\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/galileo/authorizations.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be481e6acdc934374887e2a27664fd9748038b98656cd7d6c67d7d6b9084864"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(integration.team_id) and Teams.member?(integration.team_id, target.owner_id)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/galileo/authorizations.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/authorizations.ex"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae67a97b14b6f4ee3a4593f8fd09a9d478bc83a3d83a5d9a2f069e5d16151a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(item[\u0022encrypted_content\u0022]) or is_list(item[\u0022summary\u0022])\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/agents/compaction.ex, marshall/lib/marshall/agents/model_protocol.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/compaction.ex"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"20596d913a0a4ed0d211421426f83c1f535599857fcc60557531641896195038"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(nonce) and Regex.match?(~r/\\A[0-9a-f]{64}\\z/, nonce)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/lifecycle/provisioning.ex, lilly/lib/lilly/vm/workspace_source.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/lifecycle/provisioning.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc145c071e12a1701adb34046f3bc5ee15558e70288d6a2ed0d1bb5717f91d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(origin) and byte_size(origin) \u003C= 253\u0060 appears character-identically in 2 files \u2014 porsche/lib/porsche/ssh/onboarding.ex, protocol/lib/overalls_protocol/ssh_onboarding.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/ssh/onboarding.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad100f9e2da78b6d798fbb4411fe922bee7235d6a89b5e2b77e020edf76b3b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(record[field]) and String.trim(record[field]) != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 marshall/scripts/locale_catalog_review.exs, scripts/localization_catalog_migration.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/locale_catalog_review.exs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f758af5328b8c83b7772a196742115a48ad2d4d3c4c217f00a8cc791c1887f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(thread_id) and is_binary(machine_key) and byte_size(machine_key) \u003E 0\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/threads/archive_worker.ex, marshall/lib/marshall/threads/provision_worker.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads/archive_worker.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3fb984506b5143d23eba3c4117f0563ba2b9e43c37f915c99f97b253b8088c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(token) and byte_size(token) \u003C= 80\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/control/services/porsche.ex, marshall/lib/marshall/editor/token.ex, marshall/lib/marshall/ingress/token.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/porsche.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4716317ee6d5507c3836808f1473da9ff2a831ef1c48130152437d2e777a5fce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(token) and byte_size(token) == 80\u0060 appears character-identically in 8 files \u2014 marshall/lib/marshall/compute/credentials.ex, marshall/lib/marshall/control/services/galileo.ex, marshall/lib/marshall/control/services/lilly.ex, marshall/lib/marshall/control/services/peach.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/credentials.ex"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"70855b21edfc59e74551b925988d20a5b91bd59503c3c6245c431ce5b91c3e30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and Regex.match?(~r/\\A[0-9a-f]{32}\\z/, value)\u0060 appears character-identically in 2 files \u2014 elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex, lilly/lib/lilly/transfer/clone_copy_journal.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cae76b47b2dcfaebf51666312648f4261fb515006cddd9e7b12f06e6dba588"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and Regex.match?(~r/\\A[1-9][0-9]{0,19}\\z/, value)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/host/backup_snapshot.ex, lilly/lib/lilly/lifecycle/image_template.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8816bab5b8d32f08ab1b3e38f71abcb21bff1301d0b5150876e67f1d3d9d9433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) \u003C= 12\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall_web/live/account_live.ex, marshall/lib/marshall_web/live/machines_live.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/account_live.ex"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85653e87635b67897f9343f4e86103d5d28064bac7a0d4b58489379f9a118cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) \u003C= 20\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall_web/android_display_socket.ex, marshall/lib/marshall_web/terminal_gateway_api.ex, marshall/lib/marshall_web/terminal_socket.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/android_display_socket.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4615439d77bb87c6ffb5021f4daf351d88a54ca0eaa8123937ed753013459c51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) \u003C= 253\u0060 appears character-identically in 3 files \u2014 audi/lib/audi/http/headers.ex, audi/lib/audi/tls/fleet_material.ex, marshall/lib/marshall/ingress/acme/material.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/headers.ex"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882d03e256055c8dec8584a41a2460a2966357e405a101982d2f6fce24179e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) \u003C= 80\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/ssh/token.ex, protocol/lib/overalls_protocol/editor_login.ex, protocol/lib/overalls_protocol/web_login.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ssh/token.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc06e318a8a4c512d3a337e49aa5e0a1e51f21b4acdbba1622360d9a4d2656cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) \u003C= @maximum\u0060 appears character-identically in 2 files \u2014 protocol/lib/overalls_protocol/app_route.ex, protocol/lib/overalls_protocol/ssh_key.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/app_route.ex"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"657166b5026cd8a94f90152c91de9eed9a6e45603437cdf1ee3189babf9e7c81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) == 43\u0060 appears character-identically in 4 files \u2014 audi/lib/audi/dns/challenge.ex, protocol/lib/overalls_protocol/inception_observation.ex, protocol/lib/overalls_protocol/ssh_command.ex, protocol/lib/overalls_protocol/web_login.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/challenge.ex"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5502a67a5e41984802b025770c5f2c731ccf7b7ef5c4381f54d782e4a2cb22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) == 64\u0060 appears character-identically in 3 files \u2014 protocol/lib/overalls_protocol/image_manifest.ex, protocol/lib/overalls_protocol/kernel_attestation.ex, protocol/lib/overalls_protocol/readiness.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/image_manifest.ex"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"52778bd80b8f709237340f4d86af1e7c690ff84daa5cdb4a1b5249c941b416d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_binary(value) and byte_size(value) == size\u0060 appears character-identically in 2 files \u2014 elixir/diagnostics/lib/overalls/diagnostics/context.ex, protocol/lib/overalls_protocol/editor_release.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/context.ex"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"47307d95e61297f2f72950b8a2bde8e68353dca2e07080838da6288e18609fea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_boolean(attempted) and is_boolean(serving) and is_boolean(rejection)\u0060 appears character-identically in 3 files \u2014 enrico/scripts/invalid_boot_probe.exs, galileo/scripts/invalid_boot_probe.exs, ziggy/scripts/invalid_boot_probe.exs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"enrico/scripts/invalid_boot_probe.exs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec69e78c7a8e40900770e348ce46388b7eeb52370a1ebe3de9467c624425f758"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_boolean(success) and is_integer(duration_us) and duration_us \u003E= 0\u0060 appears character-identically in 5 files \u2014 audi/lib/audi/slo.ex, enrico/lib/enrico/slo.ex, galileo/lib/galileo/slo.ex, marshall/lib/marshall/slo.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9049afdc5c55accfbeb94b97d531d20c4a8c90b407436dd584247c5bb47063c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_boolean(success?) and is_integer(duration_us) and duration_us \u003E= 0\u0060 appears character-identically in 2 files \u2014 audi/lib/audi/slo.ex, marshall/lib/marshall/slo.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c095e968b1876696e6f79e47c5692592d98ebb19842c2bc5f80f82cccd4761d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(duration_us) and duration_us \u003E= 0\u0060 appears character-identically in 3 files \u2014 audi/lib/audi/slo.ex, elixir/request_accounting/lib/overalls/request_accounting/aggregate.ex, marshall/lib/marshall/slo.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/slo.ex"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b044d223050bfb05a8cf5b0e9c99888b9dc5ccf776d9d02b0dc1b9a12001596"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(generation) and generation \u003E 0\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/network/android_display.ex, marshall/lib/marshall/android/display_relay.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network/android_display.ex"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1a9c8388099f1ab0ff40a93822a2b4ac55309b40ac5f1635674516d7bacabd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(n) and n \u003E 0 and n \u003C= @max_integer\u0060 appears character-identically in 2 files \u2014 antithesis/operator/guest_witness.ex, protocol/lib/overalls_protocol.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"281c420932026f64214363034d08e88ed4dc21aa7cafc847f81186e9d4b7e715"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(ttl) and ttl \u003E 0 and ttl \u003C= @maximum_lifetime\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/galileo/credentials.ex, marshall/lib/marshall/inference/credentials.ex, marshall/lib/marshall/peach/credentials.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/galileo/credentials.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"184cea8505dc6342eca6d3ac93b33eeedab72bbcacc9b46c1feea3e8449e3ddd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(value) and value \u003E= 0 and value \u003C= 2_147_483_647\u0060 appears character-identically in 3 files \u2014 brady/lib/brady/log.ex, elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, marshall/lib/marshall/artifacts/tool.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/log.ex"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"563ed6af0588ea600159c3fdba4149381eb9db573026a00c2d2fab9c63893ae9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(value) and value \u003E= 0 and value \u003C= 9_223_372_036_854_775_807\u0060 appears character-identically in 2 files \u2014 elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, ziggy/lib/ziggy/usage.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5713c186279d695eea881f52727c137c3c619b86beb5277ceff9fc4047b4c2f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_integer(value) and value \u003E= minimum and value \u003C= maximum\u0060 appears character-identically in 2 files \u2014 antithesis/operator/compute.ex, protocol/lib/overalls_protocol/terminal.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/compute.ex"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14e97b069b23a8701f9abd02303ef61774d2956a79a5e72086aa547278331e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_list(values) and length(values) \u003C= 16\u0060 appears character-identically in 15 files \u2014 protocol/lib/overalls_protocol/clone_control.ex, protocol/lib/overalls_protocol/execution.ex, protocol/lib/overalls_protocol/relocation_cleanup.ex, protocol/lib/overalls_protocol/relocation_destination_cleanup.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/clone_control.ex"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69a68d4a185629bacc453994d29075ac06cc75fb218b17c25fdb3e0bf752df8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_nil(record[field]) or is_binary(record[field])\u0060 appears character-identically in 2 files \u2014 marshall/scripts/locale_catalog_review.exs, scripts/localization_catalog_migration.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/locale_catalog_review.exs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cdd38110e233812fd4985307c3dd18f1f95111c0e4e479f479b101a3cefa7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_nil(stream.closed_at) and DateTime.compare(stream.expires_at, Ledger.now()) == :gt\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/environment_streams.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/environment_streams.ex"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"212a1e43174a784e0a8ccc0ab61b76f7ebc0675b1d7ff72d0fbabea9a1eb4b90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_number(value) and value \u003E= 0 and value \u003C= 9_007_199_254_740_991\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/observability.ex, marshall/lib/marshall/observability.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/observability.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d185aef4faa3361f4e22c06fbaf289405cfbbe1d599b77969605514da41377"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_number(value) and value \u003E= 0 and value \u003C= div(9_007_199_254_740_991, multiplier)\u0060 appears character-identically in 3 files \u2014 lilly/lib/lilly/observability.ex, marshall/lib/marshall/observability.ex, porsche/lib/porsche/observability.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/observability.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28d7f450698bf275ef5bd52b7a384c1cc7eb44ab66a245af813abdf782c8b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060login.status == status and DateTime.compare(login.expires_at, Ledger.now()) == :gt\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/editor/authority.ex, marshall/lib/marshall/ingress/web_logins.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/authority.ex"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd868eb126941b0f0683fd07f1f45e6013512bcfcf8e82132128aff60da3a658"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060map_size(value) == 2 and map_size(result) == 1\u0060 appears character-identically in 6 files \u2014 audi/lib/audi/control/client.ex, porsche/lib/porsche/ssh/onboarding.ex, protocol/lib/overalls_protocol/editor_stream.ex, protocol/lib/overalls_protocol/nested_stream.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/control/client.ex"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a02ec17e049032e98ec5cb53d4c4d02ee0376ea12cc64eb49c01117f9d23d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n \u003E= 0 and n \u003C= 9_223_372_036_854_775_807\u0060 appears character-identically in 3 files \u2014 lilly/lib/lilly/host/limits.ex, lilly/lib/lilly/host/pool.ex, lilly/lib/lilly/host/usage.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/limits.ex"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce03fb9566c7a2ab81ee6f7f4d7253aa2ba29c81102135e44b8d0c619af47ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == \u0022content-type\u0022 and String.starts_with?(value, \u0022text/event-stream\u0022)\u0060 appears character-identically in 2 files \u2014 ziggy/lib/ziggy/agent_worker.ex, ziggy/lib/ziggy/upstream.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/agent_worker.ex"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f2fe5e2451520f8937e8daf6256dfb647b61ad7f43e50bfe80e8104939df5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not is_binary(host.connection_session_id) or is_nil(host.reported_at)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/execution.ex, marshall/lib/marshall/ingress/sessions.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"50039b8f227c1645a059644f0408fa67c8ad89919e9324f55eda729dc83ca19a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not is_nil(cancellation_requested_at) or not is_nil(committed_at)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_destination_revocations.ex, marshall/lib/marshall/compute/relocation_revocations.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_revocations.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9085f9a696310ff90b02d3f12dccdd8a7999623e3a24c0936a7e76bb683e52d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not reservation.compute_held and not reservation.disk_held and reservation.temporary_disk_bytes == 0 and reservation.checkpoint_bytes == 0\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/outcomes.ex, marshall/lib/marshall/compute/relocation_deletion.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1648ba325bd485cdef180d29663acaa9009889f410936be534350bc1b9f7b89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part != \u0022\u0022 and String.match?(part, ~r/\\A[0-9A-Fa-f]\u002B\\z/)\u0060 appears character-identically in 2 files \u2014 elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex, elixir/diagnostics/lib/overalls/diagnostics/schema.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b95d0f0b75f445f8cb33e0cf44b851412e8d18d6b8fbd30b59ee5b5c2761cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == \u0022/\u0022 or trusted_directory?(Path.dirname(path), uid)\u0060 appears character-identically in 3 files \u2014 lilly/lib/lilly/ingress/server.ex, lilly/lib/lilly/network/attribution_server.ex, lilly/lib/lilly/private/server.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a143efdcd17f1a8cc164c17f6b6c4ee564ea8ed87066d1899a83dafe680ec45a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060purpose == :renew and reconnecting?(host)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/execution.ex, marshall/lib/marshall/ingress/sessions.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/execution.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5a354c644155d24e8c11ac027c7a8c8864cb5370d9354800ef72dc4b615f6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relocation.cancellation_requested_at != nil or relocation.committed_at != nil\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_destination_revocations.ex, marshall/lib/marshall/compute/relocation_revocations.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_revocations.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23661a637747b767910f353344d065550ecf55e0f5e740ac5a0ffdd7b25bd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relocation.destination_host_id == host and relocation.destination_placement_id == result.placement_id and relocation.destination_epoch == re\u2026\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/compute/relocation_destination_cleanups.ex, marshall/lib/marshall/compute/relocation_destination_revocations.ex, marshall/lib/marshall/compute/relocation_key_retirement.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_destination_cleanups.ex"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676995d433578f1491e4dbcbf52f538c57b5a5e034c233a9a8f6c5478137d7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relocation.original_state == :paused or relocation.wake_request_id != nil or Marshall.Compute.RelocationCoordinator.stop_confirmed?(relocati\u2026\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_receives.ex, marshall/lib/marshall/compute/relocation_sources.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c2131f5533f270801b2820833e05300416292abb57fdd821398cc3d875644"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relocation.original_state == :stopped or Marshall.Compute.RelocationCoordinator.stop_confirmed?(relocation, vm)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_receives.ex, marshall/lib/marshall/compute/relocation_sources.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_receives.ex"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"448d695a0ed507989f02aac91706108494b4748103607b344c4d2c3d2829b277"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relocation.source_host_id == host and relocation.source_placement_id == result.placement_id and relocation.source_epoch == result.execution_\u2026\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_revocations.ex, marshall/lib/marshall/compute/relocation_snapshot_cleanups.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_revocations.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19b7593d5fb852d1bac23ed34cf98806c1575f95843fb69638a3a9375f7fc4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060service.role == :gateway and service.addresses != [] and is_binary(service.ssh_host_key)\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/catalog.ex, marshall/lib/marshall/ingress/editor_assets.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/catalog.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14067cca398406157aa2486ac42fd4d498fb32f782647860a009f1b9b99ddff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.closed_at != nil or DateTime.compare(session.expires_at, Ledger.now()) != :gt\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/sessions.ex, marshall/lib/marshall/ssh/authority.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/sessions.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a0ce7883634f32d18963264e55580e7ea79a0c38915e7bffdf599e38a493ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.placement_id == vm.current_placement_id and session.execution_epoch == vm.execution_epoch\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/terminal/authority.ex, marshall/lib/marshall/terminal/reconciler.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/authority.ex"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6cd2664dc7054a3caa766e4097b390f54cb7f727ec9382dcf84ae8d0eb3477"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.uid == uid() and stat.links == 1 and band(stat.mode, 0o777) in [0o400, 0o600]\u0060 appears character-identically in 2 files \u2014 audi/lib/audi/config.ex, porsche/lib/porsche/config.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/config.ex"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf2882a3f94ae31364104dcdfa4d6b1ae54d13ad3c36d676341b887594ac0c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.uid in [0, uid()] and band(stat.mode, 0o022) == 0\u0060 appears character-identically in 3 files \u2014 audi/lib/audi/config.ex, porsche/lib/porsche/config.ex, susan/lib/susan/credentials.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/config.ex"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9fb7984dcd5b59f5a873021b35cf5f48b5316c6bf8b133493e5d7b9e05585e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stream.service_id == service.id and stream.service_generation == service.generation and stream.host_id == service.host_id\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/ingress/environment_streams.ex, marshall/lib/marshall/ingress/web_streams.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/environment_streams.ex"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"25404831a2317d52124970bb8a6f069c75a5baeb27abae0641214a391737ba27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token?(ticket, :ticket) and token?(code, :code) and state?(state)\u0060 appears character-identically in 2 files \u2014 protocol/lib/overalls_protocol/editor_login.ex, protocol/lib/overalls_protocol/web_login.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/editor_login.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec66cd2209fbab7ff173d5eb185b29d24d56f414dd9dfcacf2fa32d63554d6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060turn.status == :running and thread.active_turn_id == turn.id\u0060 appears character-identically in 4 files \u2014 marshall/lib/marshall/agents/context.ex, marshall/lib/marshall/agents/executor_session.ex, marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/turn_coordinator.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/context.ex"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e25d61f0cf371bc14b4aa34f0ad377ac4bad02a255d50e113caf99a2467110"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uri.scheme == \u0022http\u0022 and uri.host == \u0022127.0.0.1\u0022 and Keyword.get(options, :allow_insecure_loopback, false)\u0060 appears character-identically in 2 files \u2014 lilly/lib/lilly/control/client.ex, protocol/lib/overalls_protocol/web_socket/connection.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/client.ex"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ed8f1327e4dc313c721bcf2ea2a14ca7033a191363fe026d60c78a1b5d0c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vm.archived_at != nil or vm.desired_state == :deleted\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/lifecycle.ex, marshall/lib/marshall/compute/resize.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/lifecycle.ex"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"738d57a18db91b82ea55b0ac2bc875582ca9211f4d84168e3e1111b1b4bf6754"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vm.desired_state != :running or vm.observed_state != :running\u0060 appears character-identically in 3 files \u2014 marshall/lib/marshall/agents/model_calls.ex, marshall/lib/marshall/agents/thread_delivery.ex, marshall/lib/marshall/terminal/creation.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/model_calls.ex"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18a26bfabeae12b78a5cf644c3a5ce59b2ac2d3187bff93f89cee79813c3fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vm.desired_state == :stopped or OverallsProtocol.NativeAdmission.checkpoint_qualified?( vm.image_id, host.inventory[\u0022checkpoint_image_ids\u0022] \u2026\u0060 appears character-identically in 2 files \u2014 marshall/lib/marshall/compute/relocation_capacity.ex, marshall/lib/marshall/compute/relocation_coordinator.ex. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_capacity.ex"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe42711c3049b674e10430907cee9f7117416d398077bf146e673724cd80d0e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060handle == 0 || !IsCanonicalRequestId(requestId)\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/RustNative.cs, mila/windows-dotnet/Interop/RustNativeLifecycle.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a6a43753ba4d7eca8534dea17699c0a2b5749db8f0f781975d71d899cc40f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(noFollow) || noFollow === 0 || !Number.isInteger(nonBlock) || nonBlock === 0\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"89868c9ac59a7c652778e4dbe1e490333e56ecf1279a8f4c531d14d613f096af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error \u0026\u0026 (error.code === \u0022ELOOP\u0022 || error.code === \u0022EMLINK\u0022)\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d55ccf529eff2525bc4b5afdc1aa484686a9d57ad834ab95cc0036b214e44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasValidUnicodeScalarValues(value) \u0026\u0026 VISIBLE_CONTENT.test(value)\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09781300ed8ed45f8bf83de9ed8d740d9fdd3203a3d772beb2faec24861c892"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.posix.isAbsolute(value) || path.win32.isAbsolute(value) || /^[A-Za-z]:/.test(value) || value.startsWith(\u0022~\u0022)\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"56130316061141e72db635a0e68bea06edd8d9a950f41a32e4815291438d80a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment !== \u0022\u0022 \u0026\u0026 segment !== \u0022.\u0022 \u0026\u0026 segment !== \u0022..\u0022 \u0026\u0026 !/[ .]$/u.test(segment) \u0026\u0026 !WINDOWS_RESERVED_COMPONENT.test(segment)\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fa47bc3724e15d60c5c36120f1144cd866e78397bb99de44eb59b56d3d9734"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value.length === 0 || !hasValidUnicodeScalarValues(value) || value.trim() !== value || PATH_FORBIDDEN_CHARACTER\u2026\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76a544d9244bcdb4877cde17f80267fbc1d2dd307f0e60c0d4ab5163141b1f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e313f676cce3b2abb50949e18fb746fb08c9827220170818c285cc7d281712"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value === \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 .agents/skills/security-audit/validate-coverage-ledger.cjs, .agents/skills/security-audit/validate-findings.cjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/security-audit/validate-coverage-ledger.cjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb959ba701bb4ddc047a72fa998020b094e8b692c90aec5a83950449e6dbac3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060command == MilaThreadCommand.Prompt || command == MilaThreadCommand.Answer || command == MilaThreadCommand.PlanRevise\u0060 appears character-identically in 2 files \u2014 mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt, mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaThreadDetail.kt. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaNativeUi.kt"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabc4953ec1d4b109351fbf75dfcb491761d17db2a696a82e1cf24a27807627c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.host == deployment.host \u0026\u0026 it.port == deployment.port\u0060 appears character-identically in 2 files \u2014 mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaDeploymentPersistence.kt, mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaDeployments.kt. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaDeploymentPersistence.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98a3cb0388911c29e358b7f6817b9e3f14e9b47199f6fafd0c4be12cdf3de7b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending.Wait(TimeSpan.FromSeconds(10)) \u0026\u0026 !pending.GetAwaiter().GetResult()\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs, mila/windows-dotnet-smoke/ThreadGenerationSmoke.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/TerminalGenerationSmoke.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe86f0ed176b82cf7831de76ec605f646ebea0a2dfcd5ea4264defa24774b3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060account.state is not State.OBSERVED or account.value is None\u0060 appears character-identically in 3 files \u2014 antithesis/workload/access/oracle.py, antithesis/workload/core/profile_readiness.py, antithesis/workload/terminal/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/oracle.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"364b8daee19ad4b9128c09eb671929da9665ddf48d30641034c54b26b62127cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060account.value.mfa_enabled and not verify_fixture_login( config, login, fixture.admin_a, fixture.webauthn_origin )\u0060 appears character-identically in 3 files \u2014 antithesis/workload/satellite/editor.py, antithesis/workload/satellite/guest.py, antithesis/workload/terminal/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/editor.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89101091c481a8d47fa203c14b411536ce4259ce81b103fe0d38948d5815374"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060after.state is State.OBSERVED and after.value is not None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/control/scenarios.py, antithesis/workload/repository/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/scenarios.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40ec7d2aaebb2f4693817d28a0f9ad2ec000a8cece78a6547f6594692a9a53f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.state is not State.OBSERVED or before.value is not False\u0060 appears character-identically in 2 files \u2014 antithesis/workload/control/dispatch.py, antithesis/workload/control/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/dispatch.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ea4eac00c8e5e4204d7211f0707291c333f8afebbe9f530a62a605dc080096"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060catalog.state is not State.OBSERVED or catalog.value is None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/admission/scenarios.py, antithesis/workload/guest_lifecycle/readiness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/admission/scenarios.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b57b75ebcb86d03e621c892cdfc13508c79d3339bf25365cc00c49f95ffc97c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060created.state is not State.OBSERVED or created.value is None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/satellite/runtime.py, antithesis/workload/satellite/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/runtime.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5340514c43d5913d7f4ab75165be0cfc66645dbb9d3df535c0e97e7e24e32c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identity.state is not State.OBSERVED or identity.value is None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/core/profile_readiness.py, antithesis/workload/guest_lifecycle/readiness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/core/profile_readiness.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1465c64cbd37e06c58455af817265b2b1955be30a8cd4852927622fa376320f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(fields) != 2 or fields[0].removeprefix(\u0022root\u0022) != target\u0060 appears character-identically in 2 files \u2014 antithesis/verification/identity.py, nix/domains/artifacts/host/cli.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/verification/identity.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e27b9dd4775327de3ba75fe188c2c165443cfd14981ec38e6cd689b6b0ac427"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(raw) == 32 and base64.urlsafe_b64encode(raw).decode().rstrip(\u0022=\u0022) == value\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/guest/inception/observations.py, nix/domains/artifacts/guest/inception/publication.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/observations.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f9aa6b05618ecd9d426f3163fcd9f7090277ad2a5c3ea8a77380120650e9ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(row) != 1 or not isinstance(row[0], UUID)\u0060 appears character-identically in 2 files \u2014 antithesis/workload/access/oracle.py, antithesis/workload/admission/capacity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/oracle.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef58261cdff59c879ed7ce74b49915187e420830c0995c29b0e9fa72ee7257d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(sys.argv) == 3 and sys.argv[1] == \u0022--cleanup\u0022\u0060 appears character-identically in 2 files \u2014 nix/domains/system/acme/publish.py, nix/domains/system/auto-update/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/acme/publish.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d3596fd043b00d0a6e61caa3480f05c208fd0cb50d91b6c183e88cdcab47df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060machine.state is not State.OBSERVED or machine.value is None or active.state is not State.OBSERVED or active.value is None\u0060 appears character-identically in 4 files \u2014 antithesis/workload/control/delivery.py, antithesis/workload/control/dispatch.py, antithesis/workload/control/host_sessions.py, antithesis/workload/control/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/delivery.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"345d336a0531797e02b839e2217948e7caae54d3438a9bb8e3b9a0e12d06c277"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mounted.state is not State.OBSERVED or mounted.value is None\u0060 appears character-identically in 3 files \u2014 antithesis/workload/satellite/guest.py, antithesis/workload/terminal/client.py, antithesis/workload/terminal/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/guest.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef99408308b679a87eede45120e5a2437d1b66c8d55120051291eb33d5cab54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(fixture_id, str) or not 1 \u003C= len(fixture_id) \u003C= 128\u0060 appears character-identically in 2 files \u2014 antithesis/workload/access/fixture.py, antithesis/workload/repository/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/fixture.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f164df3680f72b5124ffd0effc6842c74b4eac11390bb2f490d86dc94f19ca8f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(host, str) or str(uuid.UUID(host)) != host\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/guest/inception/private_runtime.py, nix/domains/artifacts/guest/inception/ziggy_runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/private_runtime.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c553071443bbd17108cd9c94db9e2257e1fde49707599603bf28bae79da6cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(parsed, dict) or parsed.get(\u0022schema_version\u0022) != 1\u0060 appears character-identically in 3 files \u2014 antithesis/workload/access/fixture.py, antithesis/workload/admission/scenarios.py, antithesis/workload/repository/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/fixture.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee4d707c7c047456751afecc04371b9321709fc13eedd31e128004cfac1de11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, int) or isinstance(value, bool) or value \u003C 0\u0060 appears character-identically in 2 files \u2014 antithesis/workload/recorder/client.py, antithesis/workload/recorder/oracle.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/recorder/client.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d21c8263c4321ff00b9512c26e946e26db0af9c83b988d75e4903b1b5f4750b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or len(value) != 43\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/guest/inception/observations.py, nix/domains/artifacts/guest/inception/publication.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/observations.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a985c2461674f34dddb4f62451ffa722e92ee08b63228d448e9aaa6e97251ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not path.is_absolute() or \u0022..\u0022 in path.parts\u0060 appears character-identically in 5 files \u2014 antithesis/emulation/guest/server.py, antithesis/integration/fault_worker.py, antithesis/integration/witness_worker.py, antithesis/workload/core/profile_readiness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/server.py"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d5335ac5250f54ba02af8fd23c8f8184e83e753735ca477083e6064e81a4df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stat.S_ISDIR(info.st_mode) or info.st_uid != os.getuid() or stat.S_IMODE(info.st_mode) != 0o750\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/guest/inception/control_tls.py, nix/domains/artifacts/guest/inception/observations.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/inception/control_tls.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e900b8ea236a796d51164a1ef3cc67ba6c6b772b41402d0af5dc5837d3f98f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stat.S_ISREG(info.st_mode) or info.st_size \u003E 4096\u0060 appears character-identically in 2 files \u2014 antithesis/integration/fault_worker.py, antithesis/workload/admission/physical.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/integration/fault_worker.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a142137ec47b87db8fcb0ccd33392318c7d1dc142baec84bcb32115e9d8384"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not target.is_absolute() or \u0022..\u0022 in target.parts\u0060 appears character-identically in 2 files \u2014 antithesis/emulation/host/runner.py, antithesis/emulation/storage/runner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8b3b3018fa51e4348df9118ae0eac99a5bdb34d9d0bac12530a1a93cbdf459"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observed.state is State.OBSERVED and observed.value is not None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/satellite/scenarios.py, antithesis/workload/terminal/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/satellite/scenarios.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"567bc6a4f463cf61dcae43d029e4972db372ef69e0455a897074bbdb07278e5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observed.state is not State.OBSERVED or observed.value is None\u0060 appears character-identically in 2 files \u2014 antithesis/workload/core/bootstrap.py, antithesis/workload/core/profile_readiness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/core/bootstrap.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00df842845c97b51cede24918b63bf305b1b9f3b3a70b6c0cdd3335cae68d3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.scheme != \u0022http\u0022 or not parsed.hostname or parsed.path not in (\u0022\u0022, \u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 antithesis/workload/repository/fixture.py, antithesis/workload/satellite/origin.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/repository/fixture.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27c63b46e4e5c53aa0dcbdfafc41ddb1b6771e0af06d55b0064d9de6ab9bcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.scheme != \u0022https\u0022 or not parsed.hostname or parsed.path not in (\u0022\u0022, \u0022/\u0022) or parsed.query or parsed.fragment or parsed.username or par\u2026\u0060 appears character-identically in 2 files \u2014 antithesis/workload/control/client.py, antithesis/workload/core/config.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/client.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa5fc1d2cd47860eac952136e779d9e8840de391e27c3b3b3536a64f2c4a9dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser.sections() != [\u0022default\u0022] or parser.defaults()\u0060 appears character-identically in 2 files \u2014 nix/domains/system/cloudwatch/manage.py, nix/domains/system/logging/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/cloudwatch/manage.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0755ebe94ee9b6955005cbc7b80f0b53bd9580f79fdf653ae915f398e72828fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw[\u0022version\u0022] != 1 or not isinstance(raw[\u0022toplevel\u0022], str) or not raw[\u0022toplevel\u0022].startswith(\u0022/nix/store/\u0022)\u0060 appears character-identically in 2 files \u2014 antithesis/emulation/host/runner.py, antithesis/emulation/storage/runner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee0d23806722a14c2d6842fd2a513b55609d44a397ba76f3e390563022e4a95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remaining \u003C= 0 or not selector.select(remaining)\u0060 appears character-identically in 3 files \u2014 nix/domains/system/brady/storage.py, nix/domains/system/fleet-exporter/runtime.py, nix/domains/system/secrets/prepare.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/brady/storage.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f79e3ea80e1b5fbf0b391e7831912ddaadb33403e2a8330d778110147c0526"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reply.status == \u0022ok\u0022 and isinstance(reply.value, dict)\u0060 appears character-identically in 2 files \u2014 antithesis/workload/guest_lifecycle/readiness.py, antithesis/workload/guest_lifecycle/scenarios.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/guest_lifecycle/readiness.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250d25e60d4ed05c301d5bb4cd455c184df98e7c7b903f76f00db7902de3c0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response is None or response.status != 200\u0060 appears character-identically in 2 files \u2014 antithesis/workload/access/browser.py, antithesis/workload/access/session.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/browser.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c87a82b028844692166a7e73ed83ba5b2524c6eb36885b694f2fd7388b0e43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response is not None and response.status == 200\u0060 appears character-identically in 2 files \u2014 antithesis/workload/access/session.py, scripts/galileo_browser.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/session.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ee1d72c09d9e14b138ebee03b012d59d6a99f863404e9222d8624bc95f864"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.state is not State.OBSERVED or response.value is None\u0060 appears character-identically in 5 files \u2014 antithesis/workload/access/mail.py, antithesis/workload/admission/physical_scenario.py, antithesis/workload/admission/scenarios.py, antithesis/workload/repository/client.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/mail.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"976e1d7ef3d86eaf6f23f6740ec7cfaae4b8a7123fb77025b18c917014afe548"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.status != 200 or len(data) \u003E 65_536\u0060 appears character-identically in 2 files \u2014 antithesis/workload/repository/fixture.py, antithesis/workload/satellite/origin.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/repository/fixture.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a55d36846586e38a1d06ba37b9ee4251422f5667c88de6d81268765a7df2c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.state is not State.OBSERVED or result.value is None\u0060 appears character-identically in 6 files \u2014 antithesis/workload/control/bounds.py, antithesis/workload/control/pending.py, antithesis/workload/control/version_refusal.py, antithesis/workload/guest_lifecycle/operation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/bounds.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffc9ef087e4e8e5c1361628bc39988145e47840e54943a3cb8f795f70d900fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows.state is not State.OBSERVED or rows.value is None\u0060 appears character-identically in 6 files \u2014 antithesis/workload/access/oracle.py, antithesis/workload/admission/capacity.py, antithesis/workload/admission/oracle.py, antithesis/workload/control/oracle.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/oracle.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665ff72859c3e26e7dc3686d71341ca365ecc418bd7852223a67fc82aeb1e4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows.state is not State.OBSERVED or rows.value is None or len(rows.value) != 1\u0060 appears character-identically in 4 files \u2014 antithesis/workload/control/host_sessions.py, antithesis/workload/repository/oracle.py, antithesis/workload/satellite/editor.py, antithesis/workload/terminal/oracle.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/host_sessions.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"97850fa2e8e4f3b8e17380934847de86308d159e4509d3143647ee1912227496"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060str(parsed) != text or parsed.is_unspecified or parsed.is_loopback or parsed.is_multicast or parsed.is_link_local\u0060 appears character-identically in 2 files \u2014 nix/domains/system/fleet-addresses.py, nix/domains/system/runtime-firewall.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/fleet-addresses.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"51529bdc41bb43099a7f84c5be6009d8f45f2cfc2484c1fa409b0f11afbed62b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060str(parsed) != text or parsed.is_unspecified or parsed.is_multicast or parsed.is_link_local or parsed == ipaddress.IPv4Address(\u0022255.255.255.\u2026\u0060 appears character-identically in 2 files \u2014 nix/domains/system/proxy-address.py, nix/domains/system/runtime-socket.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/system/proxy-address.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbb08532bdf88df382d52fc365e8ad9663ffac4369e1113c3df9ebbd6778894"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(pid) is not int or type(ticks) is not int\u0060 appears character-identically in 3 files \u2014 antithesis/emulation/guest/server.py, antithesis/emulation/host/runner.py, antithesis/emulation/storage/runner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/server.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f2b2e9f1b605ccab324d283db7bbe5d9663c3f6bbf47ecce8904892d0ec9db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(record[\u0022bytes\u0022]) is not int or not isinstance(record[\u0022sha256\u0022], str)\u0060 appears character-identically in 2 files \u2014 antithesis/emulation/host/runner.py, antithesis/emulation/storage/runner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/host/runner.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1749e9468f32e0b8c3305cf212078a994b7a263d622173522e6cc7613875a5db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(sequence) is not int or sequence \u003C 0\u0060 appears character-identically in 2 files \u2014 antithesis/workload/access/mail.py, antithesis/workload/satellite/origin.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/access/mail.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41172afc6a0b46d6ad121698607927acae1d67b763db272f144a2b8772cae40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(value) is not int or not 1 \u003C= value \u003C= MAXIMUM\u0060 appears character-identically in 2 files \u2014 antithesis/integration/fault_worker.py, antithesis/integration/witness_worker.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/integration/fault_worker.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feef4ad323f06f54973c2bd61dd05d3a997e0e765e89368d6afdc8afe29f860"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(value) is not int or not 1 \u003C= value \u003C= MAX_EPOCH\u0060 appears character-identically in 2 files \u2014 antithesis/emulation/guest/runner.py, antithesis/emulation/guest/server.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/emulation/guest/runner.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"091055743bc35bcd3bec8e910b0f0ff3f80a4d9b54bad21016076fafbecf33b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060welcome.state is not WireState.MESSAGE or not session.welcomed\u0060 appears character-identically in 3 files \u2014 antithesis/workload/control/delivery.py, antithesis/workload/control/dispatch.py, antithesis/workload/control/host_sessions.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/workload/control/delivery.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9772d5b1268f3da7b07bc241c5db718ae3fd5301ba7f93dfb6a136a6993b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060read.Succeeded \u0026\u0026 read.Event == MilaTerminalReadEvent.Closed\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet-smoke/LifecycleSmoke.cs, mila/windows-dotnet/Interop/TerminalStream.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dd9af521a7ea2e56622db0795b8437e3ec0852cfd81016cc91cd6fec8dc863"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.TryGetProperty(name, out JsonElement value) \u0026\u0026 value.ValueKind == JsonValueKind.String\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/SessionListing.cs, mila/windows-dotnet/Interop/ThreadListing.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/SessionListing.cs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7664197fc87e7cc990d919aa888477d776cc59025a8a38d15b29b5cfc99b4e6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.ValueKind != JsonValueKind.Object || !row.TryGetProperty(\u0022id\u0022, out JsonElement idElement) || idElement.ValueKind != JsonValueKind.String\u2026\u0060 appears character-identically in 2 files \u2014 mila/windows-dotnet/Interop/SessionListing.cs, mila/windows-dotnet/Interop/ThreadListing.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/SessionListing.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"557f6ec4f4ce82b575d3febb2504cdb215b130932b1c07c3330a297615bd85f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_alphanumeric() || byte == b\u0027-\u0027 || byte == b\u0027_\u0027 || byte == b\u0027.\u0027\u0060 appears character-identically in 2 files \u2014 mila/native/linux/src/route.rs, mila/rust/mila-model/src/source.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/route.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed5dcc77c0045649402c29a6d6a3e4181f2885e5e6ea5d5b0158589cb2e4398"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_hexdigit() \u0026\u0026 !byte.is_ascii_uppercase()\u0060 appears character-identically in 4 files \u2014 lilly/native/launch-guard/src/tests.rs, mila/native/linux/src/route.rs, nix/domains/system/otel-guest/receiver/src/durable_slo.rs, nix/domains/system/otel-guest/receiver/src/request_recorder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/launch-guard/src/tests.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb859074dc9813eb3927866dc4e59e37f523e3f4981959eafa87d4aa71136f75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.is_empty() || (bytes[0] == b\u00270\u0027 \u0026\u0026 bytes.len() \u003E 1)\u0060 appears character-identically in 3 files \u2014 lilly/native/ingress-bridge/src/cli.rs, lilly/native/resume-token/src/cli.rs, lilly/native/transfer-stream/src/cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/ingress-bridge/src/cli.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"457a9bd0cfc8958114fa718d750ed563e64afed086a911b98df56e0c18fa5752"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.is_empty() || bytes.len() \u003E maximum\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/vscode-web-broker/src/windows/files.rs, nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows/files.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"962899808234d8c927faff672df4fe1e69ae977acd6f15ab655885b9973b97dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.is_empty() || bytes[0] == b\u00270\u0027 || !bytes.iter().all(u8::is_ascii_digit)\u0060 appears character-identically in 2 files \u2014 lilly/native/launch-guard/src/lib.rs, lilly/native/source-export/src/cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/launch-guard/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c819fe00a98c8c9e9216e39cf7da10605d946a2c62b8d244ed3d29139bbe385"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[0].is_ascii_lowercase() || bytes[0] == b\u0027_\u0027\u0060 appears character-identically in 4 files \u2014 lilly/native/hostd/src/lib.rs, lyra/src/guest/ssh_roster.rs, lyra/src/ssh_config.rs, nix/domains/artifacts/vscode-web-broker/src/validate.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/hostd/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c5dd7b33e3d8f412eec594650ef590e4bbd8a33f82cf484b93e28749eedc46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[bytes.len() - 1].is_ascii_lowercase() || bytes[bytes.len() - 1].is_ascii_digit() || bytes[bytes.len() - 1] == b\u0027_\u0027\u0060 appears character-identically in 2 files \u2014 lyra/src/guest/ssh_roster.rs, lyra/src/ssh_config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/guest/ssh_roster.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f50a8d55fff366294dd66f325fa694a8af629ab7ebe017c87129c211c77339"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060handle.is_null() || handle == INVALID_HANDLE_VALUE\u0060 appears character-identically in 2 files \u2014 lyra/src/sys/windows/sync.rs, nix/domains/artifacts/vscode-web-broker/src/windows_ipc.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/sys/windows/sync.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e5d702d8161df2ea1248efe729aafc4da0c2fe824667a8d1fa32c8befa37ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.contains(\u0022virtio\u0022) || name.contains(\u0022vsock\u0022)\u0060 appears character-identically in 2 files \u2014 lyra/src/platform/windows/vsock.rs, nix/domains/artifacts/terminald/src/vsock_windows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/platform/windows/vsock.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5fc80a2b67ee54ce3d96362f42f1e365f8701d696563f661309efcf7c31a4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.exit_status != 0 || output.stdout.len() \u003E 256 * 1024\u0060 appears character-identically in 7 files \u2014 mila/rust/mila-session/src/devices.rs, mila/rust/mila-session/src/lib.rs, mila/rust/mila-session/src/machines.rs, mila/rust/mila-session/src/ssh_keys.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-session/src/devices.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e715dfa704edc5071a503abdaf128c3e28e96d586249bb42ab05b2a247711afe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner.sid == prior.sid \u0026\u0026 owner.logon == prior.logon\u0060 appears character-identically in 2 files \u2014 nix/domains/artifacts/vscode-web-broker/src/windows/processes.rs, nix/domains/artifacts/vscode-web-broker/src/windows_model.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/vscode-web-broker/src/windows/processes.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb846b8f61f62071a035ba2e200107d3b160f82afb0148116491814e58c1dfb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060public_key.is_empty() || public_key.len() \u003E 1024\u0060 appears character-identically in 2 files \u2014 mila/native/linux/src/session/connection.rs, mila/native/linux/src/session/signer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/connection.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"240ae9b3bd2464b92018cc07dd2d029560b3b84acaf9be8eb16825d327f471d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060set_parent_process_death_signal(Some(Signal::KILL)).is_err() || getppid() != Some(parent)\u0060 appears character-identically in 5 files \u2014 enrico/native/git-owner/src/main.rs, lilly/native/export-channel/src/pins.rs, lilly/native/hostd/src/exec.rs, lilly/native/source-export/src/pin_sender.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"enrico/native/git-owner/src/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d277823bca57e9bf6700c04938fa78d41d0c439464fa9463340d8e03064825ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span.attributes.is_empty() \u0026\u0026 span.events.is_empty() \u0026\u0026 span.links.is_empty()\u0060 appears character-identically in 2 files \u2014 lyra/src/telemetry.rs, nix/domains/system/otel-guest/receiver/src/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/telemetry.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7840f49cc2fcf8e85e807a13d9dfb474bda80a663592579011a46e9c0d961ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status != MilaFfiStatus::Ok || written == 0 || written \u003E output.len()\u0060 appears character-identically in 2 files \u2014 mila/native/linux/src/session/trust.rs, mila/rust/mila-ffi/src/android/validation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/linux/src/session/trust.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"76060a164c8c9798a9f72171bff0a072f163e01eed64297f37dc87f334a7e93c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status != session::SessionStatus::Ok || written \u003E output.len()\u0060 appears character-identically in 2 files \u2014 mila/rust/mila-ffi/src/android/terminal.rs, mila/rust/mila-ffi/src/android/watch.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1e8d4a40104a8760bd5ae15513606379fa9589dc79997e6a8caf72bcc32fdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.exited() \u0026\u0026 status.exit_status() == Some(0)\u0060 appears character-identically in 2 files \u2014 lilly/native/export-channel/src/serve.rs, lilly/native/transfer-stream/src/run.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/native/export-channel/src/serve.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c9f170076cf240a5611ddd1ddf63fba9386a543dd9449ddbfb34bebfa7750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060username.len() \u003E 255 || username.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 lyra/src/proxy.rs, lyra/src/ssh_config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/proxy.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780cf3cfb5cfd6e121bf74cba01f842d560857c4dbf70c2274647a0a95555e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060version != \u0022HTTP/1.1\u0022 \u0026\u0026 version != \u0022HTTP/1.0\u0022\u0060 appears character-identically in 2 files \u2014 lyra/src/guest/mmds.rs, nix/domains/artifacts/terminald/src/identity_mmds.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/guest/mmds.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"72973eda72c23ebd5604a8bdaccb38b5b5ea9ca438dacf0f86908286855e753b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(byte \u003E= 65 \u0026\u0026 byte \u003C= 90) || (byte \u003E= 97 \u0026\u0026 byte \u003C= 122) || (byte \u003E= 48 \u0026\u0026 byte \u003C= 57) || byte == 45 || byte == 95\u0060 appears character-identically in 2 files \u2014 mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift, mila/native/apple/Sources/MilaNativeUI/MilaLiveSession.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaFFIAdapter.swift"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"468f0a618f82a384edffb2cb953b2ef9887a31a9cbad760d068caa81ac747300"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os(macOS) \u0026\u0026 DEBUG \u0026\u0026 MILA_SOFTWARE_KEYS\u0060 appears character-identically in 2 files \u2014 mila/native/apple/Sources/MilaNativeUI/MilaDeviceSigner.swift, mila/native/apple/Sources/MilaNativeUI/MilaSoftwareDeviceKeyStore.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/native/apple/Sources/MilaNativeUI/MilaDeviceSigner.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769b7175f0f670b9da00cdcab2371e2395f9e1da316d05a37b17eb489b963ac"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~0.9 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 79 suppression(s) across the 83379 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ParsePort\u0060 falls back to \u0060(ushort)0\u0060 when \u0060ushort.TryParse(text?.Trim(), NumberStyles.None, CultureInfo.InvariantCulture, o\u2026\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/DeploymentPickerController.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46e3b6b9f9a9a23e5fc2f58d1bdd998c6c8758bf5daf81c382f4f9884d33b2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionConnect\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 validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ba7d40b35da88562dd190237fd09f45d53a00de18516cd52453ece7e9d069a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionClose\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"695d39413445f44aed6461c656569ed3610aff852afbef3e9f87a06bdcf8150e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionTerminalInput\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c85995e6ad5e0aeec08014babfd441f1a70c54ecb5c4beab2cf4294fde14e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionTerminalResize\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"293e8fdef911233dcf66044e0f15fd057d60749652d8abd07cc114f0b05aa778"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionTerminalKill\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27713649e1da2071ec09b8130f43bced961534be7781d0d3cfeb41136eb29bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TryValidateWindowsPushRegistration\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNative.cs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcd427f1a506362eb68de86be8b0eb6ea49ecca04e6d073c73080ed0243e1a7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060TrySessionReadMachines\u0060 swallows \u0060DllNotFoundException\u0060 into \u0060return MilaNativeStatus.Unavailable;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/RustNativeLifecycle.cs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2d62faa229d508dfa554158209e70f9a003959a38c3bbbbc2afdb42fabc051"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Load\u0060 swallows \u0060IOException\u0060 into \u0060return MilaSettings.Defaults;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/SettingsStore.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2515a7787a3ba758702c68b197b40d09d111f24943c9831bb8b7a6498b18e473"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Decode\u0060 swallows \u0060JsonException\u0060 into \u0060return new MilaWhoami.Invalid();\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/SignInCoordinator.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e526c6bede000eb15b372ea1094f7deb4843a45ee6f7365ec8463783afce181"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060End\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/TerminalStream.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f77ae50dc1948eadbd81122a26d3a713c3568c4b7364fde8c4b690f77fedfc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Load\u0060 swallows \u0060IOException\u0060 into \u0060return Array.Empty\u003CMilaWindowsNotificationDevice\u003E();\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/Interop/WindowsNotifications.cs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b452653d1279efbad36733914b233bb7ff75ee1d06ca659b36529cbd5962b17"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ShowOfflineMachines\u0060 swallows \u0060Exception\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet/MainWindow.xaml.cs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaf49f9245deb725a828d5f15942d7803c9bc097df742ec1aa2025d1e034f0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Throws\u0060 swallows \u0060T\u0060 into \u0060return true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/DeviceKeyCustodySmoke.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8797462c95f6d23cb7b05b28b8d7481c45ce1517d371f3695e881f7c0ba49bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Refuses\u0060 swallows \u0060Exception\u0060 into \u0060return true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/Program.cs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81e7f0f20b40f598e30ad39da03fd584dac39b2e1dfc0c66aa4b38a083c6ca2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Refuses\u0060 swallows \u0060InvalidDataException\u0060 into \u0060return true;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mila/windows-dotnet-smoke/WatchSmoke.cs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61e217884c43c0476f8ccc95264ca713730ac0abff6b263f9507b78068f5195"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAll\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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaDeploymentPersistence.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4db00c427b87e49413c1dcf2cfd29323af3e352f60812457d054f923f8e993"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readKeys\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":"mila/native/android/app/src/main/java/dev/overalls/mila/nativeui/MilaSshKeys.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f94f29170a4290e4b4633760d771847e892e66a74d2247edbab0bd0c10f46c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_sample\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError, KeyError)\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":"antithesis/workload/recorder/client.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"125fb75e9f9e938220a637c005de5f88fdd15d6b325f5e45e4863e069bad8965"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060at_editor\u0060 (in \u0060observe_startup\u0060) returns \u0060False\u0060 when \u0060(PlaywrightError, ValueError)\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":"nix/domains/system/otel-guest/browser_journey.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb9bb6649d8ded8946ab27055e535ba245cf0953f78e73d1e6f91fbe23e5480"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060field\u0060 (in \u0060observe\u0060) returns \u0060\u0027unknown\u0027\u0060 when \u0060(OSError, ValueError, KeyError, TypeError)\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":"nix/verification/tests/machines/fleet/relocation-diagnostics.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ceba2bb492d8864dfff577b0b0ce29f9f54335809213f551253c345dd8bbfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060failure_code\u0060 returns \u0060\u0027action_exception\u0027\u0060 when \u0060(OSError, ValueError)\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":"nix/verification/tests/machines/mila-journey/approver.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2611deba7cc2d38c64574c02bb4f74799c81613f34ce735846ec583fb6a1d7de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Direct\u0060 turns a non-nil \u0060err\u0060 into \u0060return refusedTrust{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nix/domains/artifacts/guest/github/transport/transport.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d7a6de40ea79fd84cd7da65c6f5e6256bd2f9e136eb77f3e7d82897a4a8476"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060live\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":"lilly/native/hostd/src/ingress.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a891c617f288dfa9886d030a633c23b32f144d91fb5c4d01180e72b63a4134"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060new_lines\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":"lyra/src/bin/overalls-ssh-sync-windows.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3a0c16dd2d1ee3719748a95ff20e5051b19e168b8545d50beac107e017293"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bootstrap_invocation\u0060 turns every \u0060Err\u0060 into \u0060Some(64)\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":"lyra/src/agent/maintenance.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"04adc3637470cb97ac2bf3f360b0cf00dc4c4ab53b222cecb6ffe150956345cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060local_identity\u0060 turns every \u0060Err\u0060 into \u0060\u0022overalls-identity.pub\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lyra/src/ssh_config.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3a91e0bd6443070641b3bcef401c4a223032a589a4a8be227143196cadccc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_terminal\u0060 turns every \u0060Err\u0060 into \u0060\u0022renderer_refused\u0022\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":"mila/native/linux/src/journey.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd474f573b8a611e2f99d6bead738d30d7276d9f6870b47de4535079dd5480"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionConnect\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91064faae60009dcb4926f5c8754ddd9ba14d8cfdfd023fde6e1384b1ae135"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineAction\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a88e3e5c6dd2a1f4762c8aab6bdc03dec0ec8c429a2834d9aea3f0d11381cbf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineResize\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"72471e388695f1f2ce4fa7b0ad1ff654ebb660b5b6c2e21d8d8f6375fed22bd5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineCreate\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"531aeef18a870c44fa7d33169dbd2f99ab5d0a36ea611e68d49685a10806cb45"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionShareMutation\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a65cac9e1cb167bb9e21604b8cdafe3b121dc9eb0c7f0e15691fdf7df4a9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionWebSet\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfb643af4d640778282319dd1d20b80cbcd131d4fa3af2fed6e9583c86a1caa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDeviceRemove\u0060 turns every \u0060Err\u0060 into \u0060-2\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e6748f3e04b440615f740e58d9d4ee2c63afe9b29f667ef0d340692e94d225"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDeviceRemoveWithRequest\u0060 turns every \u0060Err\u0060 into \u0060-2\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c0e59688d0281bf8756c9cd3484903f3b7b0f144343d72f1833633a790fcd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDevicePreferences\u0060 turns every \u0060Err\u0060 into \u0060-2\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907afa7040101b03461ab7ab78a27d856cff75b5611a6f7dc7c1d3e562fc4fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionDevicePreferencesWithRequest\u0060 turns every \u0060Err\u0060 into \u0060-2\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"71380412318eac19be9c6c53bd20a0761b17de0d0678601e805efadca0d49ed8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionMachineClone\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/session_bridge.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a3260fc537ef9537dfdce89b24cf7244c29a6ff363ca419f024ef281878379"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeTerminalInput\u0060 turns every \u0060Err\u0060 into \u0060-4\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":"mila/rust/mila-ffi/src/android/terminal.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee22716006db9d9c7e96b3670015b4cd2585221e8adb4752df34b80b86cf71f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSnapshotSavedAt\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":"mila/rust/mila-ffi/src/android/validation.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10754b92191eb2e30db56974e4214c00d0c5520f5aa3d7a01cc51e4956ade17"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060Java_dev_overalls_mila_nativeui_MilaRustFfi_nativeSessionWatchOpen\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":"mila/rust/mila-ffi/src/android/watch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea85c82f2755292565460f3a1a5e05bd0410ff9f2ea61570fcab8f30049f91a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060presentation.read\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/scripts/localization_browser/probe.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"57927daa35b2a406075f89b73f28e2a751955d549fe49ab5a41271500f258ffa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060injectExistingTabs\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":"marvin/common/presence_config.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b850948545fbc93f580805a3427ca315ec9a36dac18db8003a1428db23cc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060verify\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_configuration}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/bootstrap_release.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa9d063d2b73c22f80bb0bad959c4f91692d6359ceedb20a77ea880ea457026"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060provider_credentials\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_configuration}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/config.ex"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aadc183c6cf584f9ed1bd405e0aaba992745482e3b8beba29b2302b202b7944"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060consume\u0060 matches \u0060{:error, _}\u0060 and answers \u0060:halt\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/http.ex"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad8a334c7fa4e3804c8f81f68bc45f76690b9251c48725d35d1ca42183f2b87"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060estimate\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/pricing.ex"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a782bf1d1f4a7fd8d55ef5e98f999d6a875a8f7cbefb23db5973c0c4d74ba8fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060recover\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :corrupt_spool}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/spool.ex"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd22ad1d78562917097fe568d446aa77689d4c9b97a4dd5a2fbe3565b6d1d0f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060clear_staging\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :corrupt_spool}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/spool.ex"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd70e441ecee01472723782d8d3d80e29bca7f5f79bce50929ae58b7d052c6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060verify\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_configuration}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ziggy/lib/ziggy/tool_release.ex"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"28725c8db9fef3c87d9ee8fbfb6c754b843a44895ddc6a4e58949c3bea5a8f83"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode_keys\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/keyring.ex"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ccfd198e7ef96c8d03bb026a3e5383be7dd25b1234aa8aa5b8fc32156ccfb8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060retry_after\u0060 matches \u0060_\u0060 and answers \u00601\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/provider.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee715c36f44563785abeae507ebc5399c58d60271b58f7ce5a85c7708b43d65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reason\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/provider/apns.ex"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd73103c96719cb9eb254d828c72f7a13825c1fdbe52825e1154012786e201"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060deliver\u0060 matches \u0060{:error, :retry}\u0060 and answers \u0060{:retry, 1}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/provider/fcm.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"225824b693f4ca027b8a48e5885d8f290ccb99e9f06ca6085a8456f1c95a9692"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060deliver\u0060 matches \u0060{:error, :retry}\u0060 and answers \u0060{:retry, 1}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"susan/lib/susan/provider/wns.ex"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde138739ae2f09c2408768182f27ae752a7662e2fc75fe43e84c49b71963d94"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060traverse\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol.ex"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd079fb7153913eb8fb9dfa9b73e4d389016504117a6ed27e171a4d1cb66d820"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/execution.ex"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c562b946430445dac2f896ade4a1d89ccc69a57ac5e4a2052da4b5d186b6f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode_platforms\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_github_tools}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/github_tools.ex"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"042bf2b2c15470544f2c376282c7559aebc795ff387ab0b72287c850893eb76f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode_files\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_github_tools}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/github_tools.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18954e18232e7bb1a411dbb42cb531f646605463fa0a2946a24bfad1c31f4cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060headers\u0060 matches \u0060{:error, _}\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/integration.ex"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b32b079cfc8dbc07e5b259ef079fa1c6fa93c8b1f35e9abda39fd5b3b3125"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_cleanup.ex"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cc74c203206e46337a44e76a167b074b29eb08d36dd98f37535f97ed3d73de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_destination_cleanup.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d8fa066909e0ba0639421af287afce7a3a2b79b0f14921fdef605b12fc7243"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_destination_revocation.ex"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"98488f1d34749d61018c5ce6e003bb69cf5ceef148fc1f9cf907ec20403042f7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060commands\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_import.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad70f2eab5d4294acd667decd7c97260f2ebd2f826acef7a2efa5a41e5a6daa5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_key_retirement.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f74b450b7ced13cb9dcb011b134907779c4ab4d65efede4c3c9319849b02dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_keys.ex"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"967f420843a089bac2b7746c22d6d3cfe55e45bb1e5c52aa9f91fbb0458d1bfc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_readiness.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"01074ad3cb1740b1d1704fba0bd4ed8520969b1461210a8fd4cc60ebe2adee66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_receive.ex"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"427951261978b8ae0fdfdc133be4ab0f097de68733a560bd3b285ee1a256f6be"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_revocation.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f77896cbe6f4bb7b298bda41e8b4009c6c5db53392ae02330e2e38e3d8d2dab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_snapshot_cleanup.ex"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f6b99d31cb40108c3af5fe0fb10aa3362f6467f44a4c746ac7172e2f676e26"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collection\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/relocation_source.ex"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d3d8a06bc59b834626f231dc7c200d2d9590172dad2c277e168cf7ae7c307e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060object\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/terminal.ex"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c106760570c1e3d13dad5f9f73c6f0f233be58bcba69939d19b13baaee97d8e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_message}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/terminal.ex"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4bcd3272e72333d22e8aad3649d92d2ad7067058af436206cb30223d806197"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060lookup\u0060 rescues \u0060ArgumentError\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"protocol/lib/overalls_protocol/view.ex"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b7e1d92df3a37da5b2ab8297882ce7b382f8ad9a5375a62e0a5d7b2ce0f2e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060init\u0060 rescues \u0060_\u0060 and answers \u0060{:stop, :invalid_configuration}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/listener.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46350e006e3fe3bef4979bbcbc048c2216ae8bdfc83f5153681d13cb5f6d5d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060measure\u0060 matches \u0060{:error, _}\u0060 and answers \u00601\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/observability.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b166e057cfb478fa8cfbcaf4523868edfa25c15a07059591a5017c9fbdee46df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_status_socket}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/status_server.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82cecdcba0600e4e71bc6994d9ba4bb0a37fe81b6f0abff43c423eb011bc5af"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060ready\u0060 rescues \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/status_server.ex"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f0a499339b6d40955a3c3d6a59a5b279a252ec4fb8bd6b57b6ffdc268700bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060session_token\u0060 matches \u0060{:error, :unauthorized}\u0060 and answers \u0060{:refused, :unauthorized}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/terminal/attachment.ex"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c246adb3cc58701c04101cb4d9fec3aeefce51ec5533a89ded73f8f7abe771f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060open\u0060 matches \u0060{:error, _reason}\u0060 and answers \u0060{:outcome, :transport}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/terminal/attachment.ex"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"490bed861825d6d7e18dddbc41fb515a0f35118de775ba88251343dc4b8fc910"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060start\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"porsche/lib/porsche/ssh/channel.ex"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8398b0044ce44bd195f69b3ed2d8ad00f1bff614ea55b31297ecd3b0618be"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060service\u0060 matches \u0060_\u0060 and answers \u0060{:status, 401}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/control_api.ex"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"077d5855c37e38e78a2e65dc62c3f7eb33a1df77b904c5cb86734f34856dc8c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060{:status, 401}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/control_api.ex"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e1ea7b912970cb3914cbd9184081433d85909eb83c66e2e0959f9fc2b04f2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060connection\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/machine_workspace.ex"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"01925d1745dd3ed1358790ceff75421bfc9db105910486c470a014337b6c0a13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060validate\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/pending_launch.ex"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ad05f9052bd15a8dbba511f5681afe2b9c2665f073849a3a53cab4d43f32c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060request\u0060 matches \u0060[]\u0060 and answers \u0060{:status, 401}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/terminal_gateway_api.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"961ff6a783c2f43d79e5065a860bf8932ccc060255daeaa569483aa31d797408"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060frame_src\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/artifacts_live.ex"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed167370ef77835b6b7317c38115ff5fe1b4817c284a9c86c585366443212a42"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060refresh_members\u0060 matches \u0060_\u0060 and answers \u0060{[], nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/teams_live.ex"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f420738f252a5263f2488091c9aac7a0359a40807d9bd1928984cae63b2e76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060list_threads\u0060 matches \u0060_\u0060 and answers \u0060{[], nil, false}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"2492e2080253ea6f8e505ba166e3458fa647442c4f861fb028e629fc07784202"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060selected_thread\u0060 matches \u0060_\u0060 and answers \u0060{nil, :unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"33783901f27ebcc1f7c079c4aeabeff0c43c54d044cb2c44d2ac62eec68fa076"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060events_for\u0060 matches \u0060_\u0060 and answers \u0060{[], false}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e17cc94cf2754173d07d326d6f51f3230db7769ec9b0aee1e4a9708bf6433"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060list_generations\u0060 matches \u0060_\u0060 and answers \u0060{[], false}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/threads_live.ex"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccbec469cf206fb69aee4756fb7abf053b6cdb6625a2773c630f44631cac7e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060count_retiring_users\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/scim_live.ex"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06b851a00685a5d859f87b41ca0e3280437a52d8593c1826fd0f41522eb8f0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060count_retiring_teams\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/live/admin/scim_live.ex"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac5d10cd7125c0d0d3f8ec5d7d7c2fcf72154b70c40c94964cebc3f1a74745"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060current_login\u0060 matches \u0060_\u0060 and answers \u0060:no_login\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall_web/controllers/git_hub_connection_controller.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"052d171ab51fc445d2e942b809e42613ef4068d7eb0679c6d4953ca66e3b350d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060link\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/app_routes.ex"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e3d7428f7773fb114cb271bb957d16bfd2802815561c07fe510ffff988f2d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060cldr_direction\u0060 matches \u0060_\u0060 and answers \u0060:ltr\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/localization.ex"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d98e4cb07683db11976923bd692a2c681f5dd4f388505b3faa23899502e833"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060negotiate\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/localization.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c26962113e1fd094ea925711c5bc9a6e829adb1ebdbbc76cb453b340738283"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060stuck_agent_turns\u0060 rescues \u0060_\u0060 and answers \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/observability.ex"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd0a0ab3f643d4bd6c0cf375970db3bdcd71b687b5ab98dac4d45ed1a97906"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parse_entries\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/vault.ex"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28ad04db50849fd612dd470c9ce24ce216c5afb5f0a422c583d48ec70872307"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060append!\u0060 matches \u0060[%Turn{}]\u0060 and answers \u0060:not_finished\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads/feed_append_job.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"917026b8d0a6441bad04a6b3056690b72ce96fba478c52939289b0975dd8565e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060continue_after_admission\u0060 matches \u0060{:error, :machine_not_ready}\u0060 and answers \u0060{:snooze, 5}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads/provision_worker.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bcac154e4d5736009cf6ccd0a3ebd6cd4aaa1ec57a4b20a3e8c4f024a4c98d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060review!\u0060 matches \u0060_\u0060 and answers \u0060:kept\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/threads/subscription_revoke_job.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"515d1b5f00e9370e14ea912a006488b53152204f8cb183513f6a74bd621cc3c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060snapshot\u0060 catches \u0060:exit, _\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log what was caught or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/metrics.ex"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4e5fe90fbf17f837603824a5c2bf332a696b5f41bf39a7e1277261d2f34cb1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :normal, %{}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/peer_socket.ex"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422facf4c461720d816f3a470352ce8c75cb9744ee3f268dbc62ab1ba341d76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :peer_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/remote.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee7745acb4cfca5b21a7844e47787f04aaf03d75d0547656be16a68e3d3075"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060{:error, _reason}\u0060 and answers \u0060{:stop, :unauthorized, %{}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/viewer.ex"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2aa116c3a5a001fbdfd477436d87dd6e2c9a2e497d00faf270ab7425cb1e18"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060recheck\u0060 rescues \u0060_\u0060 and answers \u0060:inconclusive\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/viewer.ex"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86e7c7ea9e4e9f438a8a97eddfe477f1b3bbf5c6867852f04c969aca14009d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060fresh_authority\u0060 matches \u0060{:login, :unavailable}\u0060 and answers \u0060:inconclusive\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/terminal/viewer.ex"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e31b6e8baa15efdda2b3e891cd68ae986da93cec357a273e4c26339061a4b85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060from_map\u0060 rescues \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/scim/oidc/id_token.ex"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb29d5a612a7eeebe0c46a0e39afbb65e3dffff413d883d5d4f534e8240cf0b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060operating_system\u0060 matches \u0060_\u0060 and answers \u0060\u0022unknown\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/reflection/snapshots.ex"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6363d6900da4cebb67f2d0d1f08983ccf3d2a81df48d5970ef2ff780c8664b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060observe\u0060 rescues \u0060_ in [DBConnection.ConnectionError, DBConnection.OwnershipError]\u0060 and answers \u0060:inconclusive\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/operations/health.ex"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d934b0d3ceecdc654cbd02003e2dd2d6a6fa4178264a968ba836cce36be9a7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060begin\u0060 matches \u0060{:error, _}\u0060 and answers \u0060:done\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/delivery_worker.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dcc896e681cdcb8ddd045a46187b0b163962a5200146ce25662cbe14f68e29"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060send_poke\u0060 matches \u0060{:error, :request_too_large}\u0060 and answers \u0060{:unsealable, :request_too_large}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/delivery_worker.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb280208588186b601f90639ce55f37d47271b91d9c3f42f94e90c48e7cff0f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060produce_locked!\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/producer.ex"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbdbb644a6e6269c124fed69fe916f77547b188b15e221974f9e58b9d7c43e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060poke\u0060 rescues \u0060_\u0060 and answers \u0060{:retry, :transport, 0, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/susan.ex"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7f46004c1815d0793b8a16479a97da2cdc867cb7c6b9449ceab7979c929be9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060retry_after\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/notifications/susan.ex"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c608e99050df779952a69270bd682417ccfdd187e7e37d1af4c421887a455df3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060problem\u0060 matches \u0060_\u0060 and answers \u0060:other\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/transport.ex"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e18c3f46d55f32ed5669c0ba0bcd3c2720be445ee87ca36cda05d859b57d94e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060retry_after\u0060 rescues \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/ingress/acme/transport.ex"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8dd8487395aebb0310cd15d243a6bf5ebf17f384b5997c4f9e87efc6d720de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_editor_releases}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/releases.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d34121946ba84ba7beeefd3a177473c8f74d3c8d65925e00c5e1a4391816756"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060configured\u0060 matches \u0060_\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/editor/releases.ex"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"657152075aad0a3a5c575210047c8b9e8191d47d7bd04ff20d5d3786e3f67d2d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060deliver\u0060 matches \u0060_\u0060 and answers \u0060:ignored\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/hints.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d83924a3508650312e66181b4678cc5d46645ca8da84a4d53a0e5a69ccd9566"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/audi.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3126e6007eae3bb797469f71b2a5b35f362201ed594ae44667a736f5c792a6b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/galileo.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee67d520774aa5144b8f524e50d0d70d9ca8f586d45ecee3e0ac1b19e66a171"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/lilly.ex"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fa822dd12813870f8ba3fc6eb48eb1ff8eb06bd0a486febd5b936865bef85a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/peach.ex"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eed2be55b91a27eb2ce12ae03f94a7efc424d437cf126b82ea60bef74f9c66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/porsche.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b961cb9e605ea2b6846b8eafb1aaf73c0e0153b186f918f2a2df6a533ec40"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060authenticate\u0060 matches \u0060_\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/control/services/ziggy.ex"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"966fbb031898739c675aa4272425d921f43bf78b6c3b3d2e0f18c4bc7b308778"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readiness_budget_ms\u0060 matches \u0060{:error, :unavailable}\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/image.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb71fb6d53bdd0fd32075b4be7bda06dc34e015badc69409a4816a7d704f288f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060guest_platform\u0060 matches \u0060_\u0060 and answers \u0060:unix\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/images.ex"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2d7e2c11944d534b3b88dea8cbf96804caf37cce7c1b537e127746d28771f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060resume_recoveries_locked!\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/outcomes.ex"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"515430ae422cc41b6c68daf0adc611aff6a5c63f6db9053511af6debe386ac68"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060advance_locked!\u0060 matches \u0060_\u0060 and answers \u0060:deleting\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_deletion.ex"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a9cfe4e71495a7cd9c37bdb00990823816e76e49cc0c3c627509b4f08348a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ready_request\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_probes.ex"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c20f53031d704908c88ba20ec04c1b983efa05023f1c3fd5bb587c430a01e96"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060advance_locked!\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_readiness_state.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd86afe0fb337e4e39d6bb601566d5d22bfdd000b2cf7abd974ab5eea4e50038"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060downtime\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/relocation_status.ex"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaafebcf1f491d893b14c79ed9269bc1d02b5dca8446929dbda8f06789963d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060resume_awaiting_locked!\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/resize.ex"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4a93c8fbd98690c39faf6f0eaaca3a3a6e08ab5ce4790888b9d11a26a05373"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060physical_capacity\u0060 matches \u0060_\u0060 and answers \u0060:insufficient\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/restart_capacity.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da32fc1f860f7a891c87d0d8b879fde27fa1d23d0c4da710e1a781360dcf602"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060finish\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/service_levels.ex"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d896092871a3618d43611515471f31acf66995fd9fa06e9b9011f6d52b96d209"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060activation_evidence\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/compute/workflow_service_levels.ex"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5518627f1b4950c08a684141040732d45fadb275c8ca71ac07bd467641cfc52c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060expression\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/authorization/filter.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6458cc95427aa3187487b4d7330e6a38f4865f48a274e6967ee30ef89f554ab1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :display_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/android/display_host_bridge.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbf5b3ad7f1337c450aaec0d12d527ee68b2a807904ef581590828e835436e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060begin_bridge\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :relay_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/android/display_host_bridge.ex"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af97759debf26f6e88f0b06969b43f5dba9513d212b9f2e141b36e7555da6c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :unauthorized, %{}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/android/display_socket.ex"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8db62f77909949f343ab2650f899570c8a61895f126d7983530eca2e4bd642a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060claim_locked!\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/bootstrap.ex"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"445ea7473d1c9fa9a064d852a9e938b4971a9a53128be6d209df7ac29b94e199"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060get\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/prompt.ex"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0124ab9a22b4747bd5443e90047c402464b9b7c4f627522823a62c8493c25cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060claim!\u0060 matches \u0060_\u0060 and answers \u0060:done\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/server_tool_job.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6eb98c904505bb8ace47a1031408cf7c0fab1d6674d0766c71f169611a48ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060admit\u0060 matches \u0060{:error, _}\u0060 and answers \u0060{:refuse, :failed, :invalid_arguments}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/server_tool_job.ex"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f27ec200448a16e259274d9fd01dde6fd96a6df946df6263c2dff8613809fd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060expire\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/server_tool_reconciler.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7841baa751db1ddef5d38336e10a50131bcadf64445efd5826e5794df4dd95f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060source_user_id\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marshall/lib/marshall/agents/thread_delivery.ex"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f804cdae436c3a90ccde24b5c6ddb4211c63e0b90e107b7b1f7dc1a6dd059de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060execute\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :backup_inventory_unconfirmed}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/backup.ex"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a32cf11f5173e0d497230b6f9dfef02df897801a15c5c13b6274a5819ac8939"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060inventory\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :backup_inventory_unconfirmed}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/backup.ex"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4b322e02239bf227e8ff645ddc0ee46b07ecb66af0b72dd4052c3863f760e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060flush\u0060 matches \u0060{:ok, %{state: :stopped}}\u0060 and answers \u0060\u0022stopped\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/backup.ex"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58cd9001d505689577d74a4993cb80118a52476c037b738b5c0d97aab9d5b8a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060address_terms\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/execution.ex"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f07005634af99a8df72d47f08e0d13d7d25c278fb0b6732e0005546abb9bcf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060available_route\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :network_identity_conflict}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network.ex"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b519d28b5715ac7eeb728af6fd412f34ebdb47d41ecc0894d00a4c627471cbe5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/boot.ex"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbb7a4ada6302cf3314df267b5cf6a7dc56b2da6bcda7f4f021efa777637e59"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060pool_expectations\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, %{}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/checkpoint_storage.ex"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daa4825cb92b587b95263cc194a5af2ff9c9daa9b124bf93d11ccf4e399a369"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060finalize_drives\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/disk.ex"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed15dac38490d89fca0c0fb4915fd34084f262f0d06c88fbd545e33ce73e119"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060readiness_budget\u0060 matches \u0060{:error, _}\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00cc21377c07c460846ad2bdc1a8c61da599c5a45dc7e8438c7bd6c7e187f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060verify_native_kernel\u0060 matches \u0060{:error, :not_native}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/driver.ex"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbced086476998596d90afb84695e62cbf5a24d9124142421d89aaead262d76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060start\u0060 matches \u0060{:error, :unit_state_unavailable}\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23b0df463d4d12aea680bdcf42af23e5db7b1bf4d3f53d0b6217b646df15a7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060restart\u0060 matches \u0060{:error, :unit_state_unavailable}\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/executor.ex"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59e8359a1cfbabd4f218c28c5fa9f19a4493f44e8ff7233a6cc774f447a85f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060request\u0060 matches \u0060_\u0060 and answers \u0060:unconfirmed\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/flush.ex"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c8754ec3a12373c7f03017611a67f2fa88d2d3fb4355f0e88a88884bcded70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/intent.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0cea73e02760e2f5041d1ab686101b22e3cd4faea44205deea7ba9165dda61"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060mount_checkpoints\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :jail_prepare_failed}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/jail.ex"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b587b2fd647cac0cdc0646389ef0e179dbf792d5bbf313ca83af8c3d206225"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060unmount\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/jail.ex"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b636cf81f3a5e8364b8f4cdaa264d80219ff95dae0c2ea5f94dd5ae0d53ee328"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060probe\u0060 matches \u0060{:error, _}\u0060 and answers \u0060:not_attested\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/kernel_attestation.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ed36b670986e93ca16688f82fcd4b7985022d4b1c3efa6d296d550239f12b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060check_process\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/observation.ex"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa1e74541fb033e877fa1f0a569510a07932e64d59cf6033824147bd34a935"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060probe\u0060 matches \u0060{:error, _}\u0060 and answers \u0060:not_ready\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/readiness.ex"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc196849a9c0cc8daf612e8a12d1312f0807c28f83f9fc76afc7458c54bc505"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060populated\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/unit.ex"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c710585ba9cbe5fa2c97dd29974fbd062530686214f2b50699ad283590790c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060run_once\u0060 matches \u0060{:error, {:already_registered, _}}\u0060 and answers \u0060:already_running\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/workspace_source.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7274339529c0e74977e0ac3fe7a1ecf78c56ed4a2d1df51f9979484634b3815e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060exchange\u0060 matches \u0060_\u0060 and answers \u0060:rejected\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/workspace_source.ex"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5d1e2cbd60e6f831d60536c93de8e8e297864df7ff1a04061bda1b32a97ba0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reply\u0060 matches \u0060_\u0060 and answers \u0060:rejected\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/vm/workspace_source.ex"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87cbead0dac0539fc6a9d8713cf68bcd3ab4356171c568e17ec1cb70c4aaf85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060remove_unpublished\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/clone_copy.ex"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5831e2f8dae76aea6816590ce00df7aaa971898fe04ba9734acb3cc7128ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/clone_copy_journal.ex"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b84c518d4cb8f482d9cb5948be9fd6cdb9d1db1b4ad93b301a231e641a68191"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060authority\u0060 rescues \u0060_\u0060 and answers \u0060:revoke\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/exporter.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b606a9bbdaefa04e4080d96599b39b47197057dbb3516ed2dc7dd65a0794e602"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060send_control\u0060 rescues \u0060ArgumentError\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/exporter.ex"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa1b93d649a00a2eabd6be248277fd5d8b0ec09dce0e0b51dde8b90db2d8b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20dcaced3fa01b930e5e1b99dc6e661a8aa07150b460c80f747cd44905274c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060for_intent\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e92709e944aece45d981f61cfd79273ba3f2d1f87a632e0ef0c939ce6ec4d65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060wire\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/import_journal.ex"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"372e86a34f45f42bff4bc32dd6bbb2730f2688c1a7317756f69f7bfbd482a4d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060own_key\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_transfer_key_state}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/key.ex"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f2c86a2723bb77c39ef3d4487b4f30a3c2bae9cf8fea5eaed679d5d9394969"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060staging\u0060 matches \u0060_\u0060 and answers \u0060{:ok, %{}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/received_dataset.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf7a8268c4e7a46eac82205d42efa0a1e1eb30d36a82fade4ccd7aeb6457269"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/transfer/snapshot_journal.ex"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce1cf91ddbebe26f7aa80a8be3f30a428194c106664b293910b3f74c7fb531"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060{:error, _reason}\u0060 and answers \u0060{:stop, :display_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/terminal/android_display.ex"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"21712bc18e48eba1ec32e32b8ab787b3cbe370c980e9b87a848ef36e889e7e57"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :connector_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/private/server.ex"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"11312761f805233cf1590c8a55b5fcabd3cc295c53b4e42e514e13a2270ccdfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :connector_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/network/attribution_server.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"156135bb978c5711b37415b39ac69daf836cb19f71f0cc5aa39e7f0826ccc108"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060expire\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/lifecycle/backup_history.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1592d60b81544b988dca867d75c8d7696aa7e827d1afa055fab61f14f0327f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060load\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/lifecycle/journal.ex"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac136b93bee0d6d420d2f88ce4e58c9c432f04574564c9e86fef0f9dc6c81e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060records\u0060 matches \u0060_\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/bridges.ex"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13abc6f91481a5fedb8ee2a0a0aa7d6d66561906772babc6ded67c483f2b93e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :connector_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/ingress/server.ex"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0bc444ca5a01fddfb61b3dadc51c7b7ae5c06e532541df1746dd680d32c2cf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060query\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/inception/propagation.ex"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1438ab0bc369d485c07b628fde2065d929d316329509cae5f4f50dc356fb5804"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/backup_snapshot.ex"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf5a9616be17159b4b655453a1f8904e4efb221bb2ec1bd31eed4d9005d2527"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read_cache\u0060 matches \u0060_\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image.ex"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd54c0767f07076a1ffda05978b68533a0f912b2d651e3a90ad88f339a31045d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060identities\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_local_image}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image.ex"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dd032c52963dd9c8d0e5403548407e493ed521aa5bfb3fb5172b6106c82bb3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060artifacts\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image.ex"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a128a362c64b1cf81b6924572ddfc4b52e47bb6cbf78bdb98d157cddd8eb8f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060verified\u0060 rescues \u0060ArgumentError\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_catalog.ex"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd2396a142f5d2a36da25018f5c9e733dc45bce8bea04aef814f2bc8da9c847"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060prewarm\u0060 matches \u0060{:error, :storage_busy}\u0060 and answers \u0060:busy\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_prewarm.ex"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6058858dc9f0e0ae4e391907138ac9faa86a89099dc96ef44df6555906c78f2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060retire_unconfigured\u0060 matches \u0060{:error, :storage_busy}\u0060 and answers \u0060{:busy, :storage_busy}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf09e17a9bd96703efe50d64809369a75f7ab487989ac24aa4424d907a51d7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060destroy\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5974c6d633b28a1261fa200a755f48f8e1ab38c97124cc2306837839c5c544c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060records\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, []}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/image_template.ex"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9a7d75b0c195d5c859c255872f0b28aa3d0ee1c30271a402cdd5857a68e70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060cpuset_count\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/limits.ex"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f79f783f46acb3e70dc671120e83ff83438ca4fc2278bf94a74afcaa6f5405"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060take\u0060 catches \u0060:exit, _\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log what was caught or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/pool_queue.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce980edd321b6f36d0e47a561026ea71a4a46b82d4caebda090b49afccb3be16"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read_unmapped_root_uid\u0060 matches \u0060_\u0060 and answers \u0060-1\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/root_owner.ex"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b244de2bcd57e509713a2aa6cdca6a54efcc9a54f5ab4e81b28c4ef3d0f75d82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sample\u0060 matches \u0060_\u0060 and answers \u0060{nil, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/usage.ex"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3cb15145777c48de12e5c4f8723a06b01d25aed59bf985f28e76f1e80432fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060headroom\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/usage.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882816ef9409f3ea0a1d44350556b5f97d112502d2cbd22da22780b63386195"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060snapshot_bindings\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eb7ed9e03101c8e418c7420caebba4779ad13fc4ade42f6a2caebaa3c0187c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parse_datasets\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a79a696773269e456697e04992f13238440378cd1383307ba0e87ffedac2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060numbers\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe57e009355e8e8ad2d8e43fd652df26df2efd1e1f6c8d05c6d746583fc5af"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060vdev\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9c39778b626b4cf717ecea42914d9c12aa81f5e8d762d1f87c55f69550833b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060extents\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs.ex"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da1e815627848c9548981f791a4be7fbd3b59fbd8d0357c6c63ee029e0666"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060publish_drives\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"215174920260185d1a7f89b86fd828d7658a8120db0db5d374f0dacfcc49012a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060resize\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"3987501d4b55c359023073685e40c0606e7ae65b56fc0ae4465a02e1c8e1613d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060audit\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_dataset.ex"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b190cd205fcb92ce9f3f550d2b1566f33c5c9259dab7eda8d30fee2d318c93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parse_rates\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_io.ex"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb25fd5a62a24f3cbe3c52fe4380e77d179249335517ead5339539d091fe0f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parse_identities\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/host/zfs_io.ex"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"89507f067b3c1dfda7ad29127fa61e3ae7584f9769532fd7b5a53c72ab25be75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060guest_trust_roots\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/config.ex"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4825f2f3d4b7f2f2e26b4217d51e1d3733af4e96165a8756b73e5675b5ad72"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060images\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/config.ex"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cabc7feb2f70c5f26cd8ff96c70ab1a6e19ca3a4858be3a3ac2953f26dcbdd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060pools\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/config.ex"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e67fc68746f2972b4b8ec05441b8f1b5f73415765414ebc06fdcfdbe72b32"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060handle_info\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/runtime.ex"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7414de6396b179e7b5a551266ec6e15311422918be2c7db4ade7e12af30a009c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_status_socket}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/status_server.ex"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76f834796713c8c4eeea872b7047d01a7ca8f2ec6b0f380fde9dd580ea22afc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/store.ex"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2b07ed1294279780c0db3517a9ccc3397af819655ac3dffe7a40f1f7b86372"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060all\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_stored_command}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lilly/lib/lilly/control/store.ex"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ff1ae151e27ee2ddb9e29d0f5523c4ac4c19e41e41065d11dcedc39467ec9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060consume\u0060 matches \u0060{:error, _}\u0060 and answers \u0060:halt\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/http.ex"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4ec4fb40941dde435774aec782a6441c014bc37bedcccd04c8328bb55535e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060consume\u0060 matches \u0060_\u0060 and answers \u0060:halt\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/http.ex"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9442b42058c0e7b02cd1dbe043acb5584cab490e8e7e85004682e75372dd8d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060renew\u0060 matches \u0060{:error, :unauthorized}\u0060 and answers \u0060:refused\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/http.ex"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a498885b8b9009544b9f2c742c8c9db4ffb566a3813b36f452fbaf2d3342355a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060batch\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_response}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/lfs.ex"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7360ca1ea0446bd27d0dc8b8327a77a1e222340db31604a5390fad3a2c3e957"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060actions\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_response}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/lfs.ex"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"028d793964a700b21df985b6d3f27b8681a9a06146f4dc48f7e7d6e744f699f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060headers\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_response}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/lfs.ex"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8a5651bb6a414632d617226ce9c5479a225d2c02e88c9e995eb184f3edb898"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060headers\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_response}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/response.ex"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35878030179d3e82dd6fb74edce1dfce9554087ce97d2a0c30a256f15b76d65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060links\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_response}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"galileo/lib/galileo/github/response.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"14348b47ef22766b3c0e0b8996503a7cf675e6e61af95cfc142ae309211beed2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, :new}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/request_accounting/lib/overalls/request_accounting/quality_marker.ex"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"513f9071415282e844dc105f292b8d304369ada5dafa613bca66cec9c8f31e92"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060span_context\u0060 catches \u0060_, _\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log what was caught or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/context.ex"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"290b89735028a8950055526d567169eb8823091662a7e5536c31fe47990c2644"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060timestamp\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/formatter.ex"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5bbf23e4073edca4c58b578bb80fa8a28f25a221cec7d1df9bff65dcdcd4ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060timestamp\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/formatter.ex"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528ebc45d41e71375eb60819f7901a226677ea020418c0f2d5870edf13d3538"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060enqueue\u0060 rescues \u0060ArgumentError\u0060 and answers \u0060:dropped\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/processor.ex"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c69b13770adafeed3f5345c95a26da04cb8028df30abbb2b7b6424fb4e3991"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060projection\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/diagnostics/lib/overalls/diagnostics/events/catalog.ex"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"35efcb71c1c16ae0ba9b304697b591b9c39bf0f47516670bc1b1b3a367b94482"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060lookup\u0060 matches \u0060_\u0060 and answers \u0060{:cont, :miss}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache.ex"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5ca93cccc6493f7a76b199a0f57aa9e08c3c5e5d040e86816defb73a47a0c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060begin_write\u0060 matches \u0060_\u0060 and answers \u0060:bypass\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache.ex"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2981e2b70b64a8f98e5577f57479c4bfc4c1535093427553bc27c2b7e0a48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060response\u0060 rescues \u0060_\u0060 and answers \u0060:miss\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache.ex"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b707a8a0905147f4a92568d967df168d8786ee89192d6578b0a94f22652454"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060exceptions\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/config.ex"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"40724f7d489892fd884be36075d5d3d894ca45d2f39f5edf9b493277acae93cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060policy\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_policy}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/destination.ex"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaee5016f08d011358902fdc5491a76350d119be451fbdb4b4cd9d155bf2853"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gauges\u0060 catches \u0060:exit, _\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log what was caught or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/metrics.ex"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6543ef98c5326f3152bcc697b3da06cb52755f8cf17b7967c6abaf8d7fdc31d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060deliver\u0060 matches \u0060_\u0060 and answers \u0060:not_attempted\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/proxy.ex"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1343c6232384e662f2377e4edba3893d121b30407e105ebfa73994cfe0656"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_signing_credentials}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/tls/certificates.ex"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b268d4e91820e2d26dee8d0fcccfe18b555236ff2d45db974844d19fdf17e1bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060admit\u0060 matches \u0060_\u0060 and answers \u0060:bypass\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache/policy.ex"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"961198e5fe4d4d470b29bcdd0b8e8651e6abfab152e7acefbb5781e39e66280d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060directives\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache/policy.ex"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"754f9c2b3c838a86c8e44a538a35c7dde1b86fdb56fbfdfd19f369420fe988d6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :cache_storage_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache/store.ex"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2857c1eb98c58a728911cfacbfcdd2cbf1d3ab842e2af1217cce1adb9596bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060recover\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache/store.ex"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf4d7ac582892018d7571bd75ef8b1afce9f50233211ba2a1437f0d1629168c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060recover_shard\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"brady/lib/brady/cache/store.ex"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"def2408fbef8b4c92577b59c2f98db254ae9a13ae7c43a810d073fc285b30974"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_status_socket}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/status_server.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"48463970167d07943ded2785757e49a5c220ee7da9433ab9dbbc07b836ba2469"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ready\u0060 matches \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/status_server.ex"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af8c3ac8361e7f4590300e1816be453734d0ec9b7e382f479fa5cad81474b6d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060safe_health\u0060 rescues \u0060_\u0060 and answers \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/status_server.ex"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4607bd0c3c3a68ca1a3d9ffc4c669ffe836d9c799102aabef1e0f2690d90ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060refresh_catalog\u0060 matches \u0060{:error, :unsupported_version}\u0060 and answers \u0060:unsupported_version\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/tls/fleet_worker.ex"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc95f3799db48f28ebfa0c25bcd5e7301edae24c905f4d81ebe3d1e6b84b90e2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sni\u0060 matches \u0060_\u0060 and answers \u0060:unrecognized\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/tls/store.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bf55301aaf0dce8cac400598e8fda7635fa325acc6e6d28ba3e29e61db50c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_tls_store_configuration}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/tls/store.ex"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4f92cff5bf1685ac3f3468d506e2ff139d1fef37e5f9d110488a10a5668011"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060guide\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/channel.ex"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df59971dd16c7b3c2c58481cde51cec236619aaed8d61bfd14c6208fe4fd6ca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_host_key}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/key_publisher.ex"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d600b1692e9e1bc7cea97fcec366780547cf225427b583fed293a2a7fe6608b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :listener_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/ssh/listener.ex"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f44c32b05c67e3079130a36f945130ff874dd8fa666d8fa0edd0e7e4162aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_relay_configuration}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/relay/server.ex"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2808bd6b2ae2101e519740a2815592ad7054c2d91c0e27262049e9fcb812ec4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060answer\u0060 matches \u0060{:error, :response}\u0060 and answers \u0060:drop\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/private/dns.ex"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db71dd635940455196cd1e35932cbf093ec52a8448752bc38819376fe262dbe9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060load_registry\u0060 matches \u0060_\u0060 and answers \u0060{:halt, {:error, :invalid_editor_assets}}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/http/editor_assets.ex"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da53793da63b24bd4ccb87d8f3ea74adf55ddf5aab5deb51dcf6dd11fb7d5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060answer_with_outcome\u0060 matches \u0060{:error, :response}\u0060 and answers \u0060{:drop, :exclude}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/authority.ex"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0bb410e3f6c084cadcea87f6570d6c0ebc6c04229f4fba4c974b7eed3d781f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060lookup\u0060 rescues \u0060ArgumentError\u0060 and answers \u0060:stale\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/directory.ex"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a773b8003f0b52a6fb9338932de3c47f795b1715db8e0c1e7347a7ead714ef3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060handle_info\u0060 matches \u0060{:error, :unsupported_version}\u0060 and answers \u0060:unsupported_version\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/replica.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfcf7ca1878bc993d47017c2849a10dae0a3150ce6c28fcf69c37c157063e6c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060records\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/snapshot.ex"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a5f6570b102beb4dfac61e73c1d8fecb8efca148abda558fede563bb59fd27"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060entry\u0060 matches \u0060_\u0060 and answers \u0060{:halt, :error}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/dns/snapshot.ex"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"def1b179c2e94fff4c732869ccb729e990234bc110af60d16303eeadc72f2ab3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060init\u0060 matches \u0060_\u0060 and answers \u0060{:stop, :invalid_grant}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audi/lib/audi/authority/stream_guard.ex"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a83e4186a686f56a3c91afe26d649e658e4e6d245a8467187d9048b3880c87"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060placement_tuple\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022current_placement_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"362296da3c729f68a267fdf1af40a278871410e3f388b32f4c0f19052f968089"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060current_replay_binding\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022current_terminal_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adbafd423c160902ff1093317663e5f302aa23de05b3f5700d8823e3775eb62"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060issue_replay_arm\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022terminal_replay_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"211efd3c37cebad62ff6301fbb16057a2d173ecabe476caf3c01692e9e0da181"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read_replay_receipt\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022terminal_replay_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7484ecdd4edbd0ccde458f607e86f9590e80d895b536a9d8072bb1958b70aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize_replay_receipt\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022terminal_replay_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd62d6be7f0c066014dbc83a982afeefd88b2f69ae89093b02fd1cbcdcdda0b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060observe\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b790d85ea2ccb7fae1f864ae5222288aea4956dd55b325ee8128776b2c6517"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060issue_crash\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_fault_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5f9bded9fbd92eaedb03ee5f85ccbed8d56c412e9574f12ad0cf7cd4699f2c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060await_crash_receipt\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_fault_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2f2758e8db61000d299f13090aa07995a0dccca436060d50f8854b1b24c34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize_crash_receipt\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_fault_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7072ed7246b87edf38877656a901a73e23bed294c5ba0f11b876a84b215c48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060query\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c129efabf08342d288a345692761a03c7317b97f74f9d81f2bbaacc73f9daef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060query_socket\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5c819aa515428081d3ba71b2d4676ff78de131e514e54f1bdea0938bb53f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060query_spool\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4373696409e083e284dd40adb99f9ba4a7a63c9d473cc6cb96c85d1228fa73"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060await_spool_response\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"459e5a4f1619155304c3f7e4bcd5a8c4b3cce08e92c21abf0fa43a46772a2049"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"70709651e1a85d8f5a5ce6b43a1e7429d1016c7134ec5c08d08eae0a9a43f1f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5e8990016ce09fd3f4f47aa4262dfcaa5167254d5259906a687f4608f2ce30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f7e6358118625ef6e90071031750a2ab99f568976d1b1d1e2e0d1823c399c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060sanitize\u0060 matches \u0060_\u0060 and answers \u0060{:unavailable, \u0022guest_witness_unavailable\u0022}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/operator/guest_witness.ex"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"42808ad07ae04d0483d9e8ef7e5a534f58729afef399308a39da4e29fa7ddfa1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060settle\u0060 matches \u0060_\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/controlled_executor.ex"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a610c16f8a65e8a3e6fd6c4bd3ce3bf584c8212a5ed08c5a6f9a828ca71d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060read\u0060 matches \u0060{:error, :enoent}\u0060 and answers \u0060{:ok, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_boot.ex"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf369a5d1304e7b04c315e83713d546b0b60ea775c67be45d30241850361c008"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060reconcile\u0060 matches \u0060_\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aaa8eacd97c457dadb74cde1aabcd27f3a7ee9c455e2fec774f0a0b9bdb3ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060start_or_crash\u0060 matches \u0060_\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c94cfd5d0697ad0c80d561d6472ef69403f56fd0fa09e8b19508145e5f5b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060start\u0060 matches \u0060_\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"22562c21be205b9ed2e184d66c26a619e22dab79f5f5e8e83d519d7aa7cbe4fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060stop\u0060 matches \u0060_\u0060 and answers \u0060{:retry, :execution_unavailable}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/guest_executor.ex"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d67c2d882f9cc09099652b5c71af07eb4b1bffb2b184db5239475be2adc0de4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060image_ids\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antithesis/lilly/lib/overalls_antithesis/lilly/stub_storage.ex"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7066ccabe39a2e8cce03fdc2bf5f1b21d28a0b659c40a1206f9e4d32c0bb02"}}],"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-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-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"Improper Certificate Validation","shortDescription":{"text":"Improper Certificate Validation"},"helpUri":"https://cwe.mitre.org/data/definitions/295.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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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/"}]},{"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-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-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":102,"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."]}]}