{"$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":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"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":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"celld::async_main (cyclomatic 254): celld::async_main has cyclomatic complexity 254 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b5eb07ee32c9d9a24067ec84ccc79abd602342b6bb6ceaf012e4f5eee70105"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 135): (anonymous) has cyclomatic complexity 135 (threshold 15). Most of this is not in the body itself: 2 of the 135 points are its own statements and the rest belongs to 47 function items inside it that branch (enqueue, read, _setup, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0577947d9e55f97e210ce0b92462e3d5d477de06dacc18b4fd0cad6ec9f9ca9"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::read_project (cyclomatic 115): celld::deploy::read_project has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab94d65ad6c40f7f1aebd13094531e35721a5aa64d94e1b44a94a1bb8c9e4af"}},{"ruleId":"D1","level":"warning","message":{"text":"Actor::execute (cyclomatic 105): Actor::execute has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1588c6202a29b38bd488e6748ce519300b597f9b59535be68b77ae88e3fca6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"kv.kvService (cyclomatic 103): kv.kvService has cyclomatic complexity 103 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 15 belong to 5 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":"crates/celld/js/services/kv.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d364cbe8e59757dc14906e5fb31d57190c6a191bcf4cafe5551c39b83c7417"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.formatRaw (cyclomatic 99): node_util.formatRaw has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c765b51d275894bec576c59c553072856be9e07546d608000e76244cb48af5"}},{"ruleId":"D1","level":"warning","message":{"text":"State::validate (cyclomatic 86): State::validate has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ff808a56af78af597627089ff706d93b208f38d45ce4b7526d64b1d93ae9c4"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::crypto::crypto_operation (cyclomatic 75): celld::js::crypto::crypto_operation has cyclomatic complexity 75 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a688fb1d669dd3375aed2527c7388edd0cfd1b68e55c114f67219477e8218f1"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.innerDeepEqual (cyclomatic 71): node_util.innerDeepEqual has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7aa14982513b9beb0ea85347ffd00ada1e37e459362bc3d5725cb0640da2ca"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 66): (anonymous) has cyclomatic complexity 66 (threshold 15). Most of this is not in the body itself: 2 of the 66 points are its own statements and the rest belongs to 33 function items inside it that branch (_pullInto, _errorRd, _cancel, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/identity_transform_stream.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfa3b12bb9ab4fd6249dc5641e15f4aed86405ebfec33a8270f0de692eaea53"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeLogManager::recover_serial (cyclomatic 54): NodeLogManager::recover_serial has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":4919}}}],"partialFingerprints":{"codehealthFindingId/v1":"09122f2971c596635b27f6c42e9b8a821f389683411e3fb7cbb42cd8a55fd064"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::node_log::stream_lane (cyclomatic 50): celld::node_log::stream_lane has cyclomatic complexity 50 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abbbdc6da8333fd21402c189dba589ca6ff1115131f02e33518b1f0dd5abe29"}},{"ruleId":"D1","level":"warning","message":{"text":"__stubLift::lift (cyclomatic 48): __stubLift::lift has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e249fb86fa5b6270a0836e00153fb00ae9e9b13725aafc9604f41c7312dc52e6"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::ltx_repl::ship_loop (cyclomatic 47): celld::ltx_repl::ship_loop has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5202beaedbf8e57bc3e187ce5cb3fd140c8812f4acb6f706d0bbdcace5d55a5"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::runtime::wake (cyclomatic 46): celld::runtime::wake has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c6901b3330e506b51f6a00f7e5e5145c9900e15053aade5d6b0ac4c95ca06"}},{"ruleId":"D1","level":"warning","message":{"text":"__parseFormData (cyclomatic 45): __parseFormData has cyclomatic complexity 45 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0316f0bc1a33997cfaa7a8069456d46bd625d4a78a1992ca6326ffaacced674c"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::main::cli::action_from_process (cyclomatic 42): celld::main::cli::action_from_process has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3b29aab8ed98055a791949d043fb086b4f8cd14327174665e634129c35d02f"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.constructor (cyclomatic 42): Request.constructor has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c2a9d6e0b012bd4ce47e6e092d6f26bc6ef06fe78917b41a90a29afe893c94"}},{"ruleId":"D1","level":"warning","message":{"text":"relative (cyclomatic 42): relative has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c439dd81d698454ea392610b43ca6693ef8b84b72e94f228d0a7883b5a70361"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::op_loader_load (cyclomatic 40): celld::js::op_loader_load has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7c8c21e550faae8b71e92fd86d7c483875f818fae6e00d54733ef151e9e2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::runtime::drive_cell_inner (cyclomatic 40): celld::runtime::drive_cell_inner has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed286b5dc8806bdf26dad2c702c99514a954135507a563a5d68848a78440f81"}},{"ruleId":"D1","level":"warning","message":{"text":"parse (cyclomatic 40): parse has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de6d545bead9ca25edf5dd2a395e43da3a19d65be16a593db2c0100e744c510"}},{"ruleId":"D1","level":"warning","message":{"text":"Actor::handle_message (cyclomatic 39): Actor::handle_message has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27868af7cd599bf2c796cd8d32b72c3fee85a9554874bf96e8396a148df0225"}},{"ruleId":"D1","level":"warning","message":{"text":"node_assert.deepEq (cyclomatic 39): node_assert.deepEq has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f4089bc7a9e972727cb20e4d38b7e584ff0a8e22f2251f6a06da20f996209d"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::op_fetch (cyclomatic 38): celld::js::op_fetch has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8990}}}],"partialFingerprints":{"codehealthFindingId/v1":"350ba8c9771f8eb31c6031e7ef852085a6e38f0901134da060283780685fdbca"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::handle_internal (cyclomatic 38): celld::handle_internal has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3342df926448352ef199728bcb3811feb97f44be86b638e46e8031d54bc0e8e"}},{"ruleId":"D1","level":"warning","message":{"text":"get (cyclomatic 38): get has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 7 of the 38 points are its own statements and the rest belongs to 7 function items inside it that branch (doFetch, get, invoke, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113a2df6b8ef4430de24d8c797980cd0fc9dd5f594dd8380247bcc42d74ab62"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::parse (cyclomatic 37): Command::parse has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719c3caf07e3c5455ab70a9bd487c9e6393537abd22c39a9dff29b97e77434c"}},{"ruleId":"D1","level":"warning","message":{"text":"__WorkflowCell._drive (cyclomatic 37): __WorkflowCell._drive has cyclomatic complexity 37 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 14 belong to 8 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":"crates/celld/js/harness.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ea9b3686245e1be8e6650145aa7fcb4a11f4d417d4c41a7338b8e601069f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__rpcProject::project (cyclomatic 37): harness.__rpcProject::project 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":"crates/celld/js/harness.js"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbecd00bd4e8bb4d22dbaac64e479c10f7d7552f4ae3770da15503c628e56bd7"}},{"ruleId":"D1","level":"warning","message":{"text":"resolve (cyclomatic 36): resolve has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebb37669d22008c61613a6821c1cd55fc1e402f0e5445f57fa33bf3ce3a308f"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::dispatch_do_call (cyclomatic 35): celld::dispatch_do_call has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9ab76e55c8dd91e7e38e4e1930c390aa530a5d5efa61d4f366f31950ba80b3"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeTo (cyclomatic 35): pipeTo has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 15 of the 35 points are its own statements and the rest belongs to 20 function items inside it that branch (a function literal at line 640, a function literal at line 583, (anonymous)::finish, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"82156c10afc9a4f0cc3829364173464e3d520c84e7beba75996a2229c93f8ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.isFullWidthCodePoint (cyclomatic 33): node_util.isFullWidthCodePoint 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":"crates/celld/js/node_util.js"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ad076054e07b2141d6e7e43d9a9539c64e0a7c9dd1c3bf5502697107ff067"}},{"ruleId":"D1","level":"warning","message":{"text":"__wfMakeStep.doStep (cyclomatic 32): __wfMakeStep.doStep has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 8467, 8514, 8552). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8443}}}],"partialFingerprints":{"codehealthFindingId/v1":"79008161dbc2aff254196699801413aa4dc4a1535b0e5148077dff9944ea6d29"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::parse (cyclomatic 31): Command::parse has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/r2_cli.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14f48d6591799d276fa53033626e424942868caa0263bd8a5425c22f42afba1"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.formatWithOptionsInternal (cyclomatic 31): node_util.formatWithOptionsInternal has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"131e27b92d20c75979272bda4f5f374ca93599f8481eb7a6bba324cfca31e173"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::from (cyclomatic 31): (anonymous)::from has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac31cdaaf60c635735e906dbf1f43ccdf757662c4601aba5a8472d678a6b92a"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::load_config (cyclomatic 30): Worker::load_config has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5807}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ddee7008e3788f7e1a097b798781faa71a4be12594aaebdd8e72a11240749b"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeBuffer.from (cyclomatic 30): NodeBuffer.from has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cefa09a18f695e2604b3fa3d438082d962b1a56e49cfce1eabecde9c5d69b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize (cyclomatic 30): normalize has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40b3ac5a685ef8f1d96ea4c9b7db6447cda96f56ec08b59cf20688757d399b5"}},{"ruleId":"D1","level":"warning","message":{"text":"LtxRepl::activate_with (cyclomatic 29): LtxRepl::activate_with has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1ee420b8123abcee0e3f5aa3d52d42b10fd5ab79aece6f0a51ebff575f6b96"}},{"ruleId":"D1","level":"warning","message":{"text":"FollowerStore::read_tail (cyclomatic 29): FollowerStore::read_tail has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d14ecd55897f7e9f2acc03f3a4c9493528320c0dd32c69285d0a641793750e"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__celld.__makeR2Bucket (cyclomatic 29): harness.__celld.__makeR2Bucket has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5358a30a33d7e2d42d053818d1747e16f4708fcd101b95469ea49a10530060"}},{"ruleId":"D1","level":"warning","message":{"text":"formatValue (cyclomatic 29): formatValue has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b619d7ab72e7c45acedabfa576bb7d097ac9e10b7d4be79991a7c1d1dcaf3e7e"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__wfMakeStep.do (cyclomatic 28): harness.__wfMakeStep.do has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 8467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8443}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fae47549e1979076cd94103df2f935593af3b7fcb9e82a391978a2edae20c8"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::assets::validate_index (cyclomatic 27): celld::assets::validate_index has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f155962a7e2980bd4a98677728435fe7b66a1a0bac4b974ac21473d70c2a90ae"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::bucket::azure_builder_for (cyclomatic 27): celld::bucket::azure_builder_for has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37b28e4292458cc3b62c146addc807ca1f31693d8bdb694b1fdf40888284084"}},{"ruleId":"D1","level":"warning","message":{"text":"_leaseBatch (cyclomatic 27): _leaseBatch has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 6883, 6865, 6818, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":6800}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f8757a887d9d069db28b98d94735908eb98d72ac9b3425512113310cade69"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::fill (cyclomatic 27): (anonymous)::fill has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacd182c45d67ebb3bca1aae039c42ec46da66e79bf5a0e0e2d8331eab72c79a"}},{"ruleId":"D1","level":"warning","message":{"text":"dirname (cyclomatic 27): dirname has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2d8516f84896015b2070b4ec253e7ed95866b2bebe1c4a41eb60ed2581e218"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::parse (cyclomatic 26): Command::parse has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/queue_cli.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cbcef0088e5af47ccd70ebb24b11c61ddf38dabb481d7e1c52200a0ecfcd09"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::control_plane::handle_explorer_request (cyclomatic 26): celld::control_plane::handle_explorer_request has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce962a81e9ef61f1b9c5c7a885afb912094d72198c73b1156d4ee030eb13f76c"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::storage_ops::op_sql_cursor_start (cyclomatic 26): celld::js::storage_ops::op_sql_cursor_start has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"664af10629f5447f537d155b0dd5aafb2388133a80717a4bdd4fc85f5f6a4f75"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeBuffer.fill (cyclomatic 26): NodeBuffer.fill has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7426b215e936aa0cef910b6cac9bd487abcd7d62f32a579a1802ab64c569bde6"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.formatProperty (cyclomatic 26): node_util.formatProperty has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1468a6bfd53ed7b8a98e178718cc9513e17987b707e07f078db4e0cac3bf0e"}},{"ruleId":"D1","level":"warning","message":{"text":"generateKey (cyclomatic 26): generateKey has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ea8b61cfbe00fbcd53ebae1d998fc02bc2326408e5554716ef6b8ef61f3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"__makeLoader.encodeModules (cyclomatic 26): __makeLoader.encodeModules has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021ff2d5be87fb2719f828f694b1a3dbeb3bc413b749f677d0a82f3c591a90a"}},{"ruleId":"D1","level":"warning","message":{"text":"__stubRevive::revive (cyclomatic 26): __stubRevive::revive has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9401bd272ed8c4841a60478b8918da6feb906b3c6d1a9ab1fbfd02c477f96303"}},{"ruleId":"D1","level":"warning","message":{"text":"relative (cyclomatic 26): relative has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e70c30134eee6c4eafba089819295791e7d2acfa7b66ce4d599f33bd8b5aef7"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::control_plane::apply_deployment (cyclomatic 25): celld::control_plane::apply_deployment has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b595e5de8159ab99e3efd28555c99b88ea6f5db0a4547be5455a377c273a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::html_rewriter::run_rewriter (cyclomatic 25): celld::js::html_rewriter::run_rewriter has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"77948bc57d5bbb72dddb462b1984e7feabe74eebd7884f24ffab448b8a1ef130"}},{"ruleId":"D1","level":"warning","message":{"text":"State::alarm_observed (cyclomatic 25): State::alarm_observed has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld_logic::on_event (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"334a12749fef550304dda64b84d78c88765c9d1ff2c254b2990a58ab7a39c7f8"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__celld.__makeLoader.encodeModules (cyclomatic 25): harness.__celld.__makeLoader.encodeModules has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e813cdd7126bf4c48775dda1d274feeed3c77ff1e7169c4af7e5b4b31b0d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"_rearm (cyclomatic 25): _rearm has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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":"crates/celld/js/harness.js"},"region":{"startLine":6519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c1500cd8b13a8c4a5a0302185a3bfec5d3cfb3cfe98c1eef74420e30725836"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetResolver::response (cyclomatic 24): AssetResolver::response has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4ecac80e825611903b8e80b4f96a3c2e6887960724be40179702fa8b2edf5a"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::read_bundle_config (cyclomatic 24): celld::deploy::read_bundle_config has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld::deploy::asset_content_type (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5aa3ccd6d6de65859ddd18d0c22aeb17ba6cda42bea1b6d91cfff4bc49c836"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::storage::sql_cursor_start_values (cyclomatic 24): celld::storage::sql_cursor_start_values has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f92bd710ba50232a47fd0bdaddd8d17253081a139701d3c8b94c0d2df027df9"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.keyCheck (cyclomatic 24): node_util.keyCheck has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8db697b4ef3569ce876438ece0e7b942d35ab63807cfbe0154575ddab84955d"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 24): constructor has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c8ef682a267ba1584b85e3461365e639d3f39f713e775e454cf8b6c77f1c0"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::kv_cli::run (cyclomatic 23): celld::kv_cli::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"872ca318e06dd6fc8c1c9e61d06a01b6c18db0551e4722822ac62bd55b5399e9"}},{"ruleId":"D1","level":"warning","message":{"text":"SubtleCrypto.importKey (cyclomatic 23): SubtleCrypto.importKey has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"187f61fb4a4dbf990cdac60944413b96802e9b954ff77e9de95de187a7f1370f"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.strEscape (cyclomatic 23): node_util.strEscape has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"57933794856620fcff581f3f4ddf4fe8aadf75fae6f1e50f70dff855000126f6"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.groupArrayElements (cyclomatic 23): node_util.groupArrayElements has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae3e891f9573199a4805fa9bcb2517dfdf7b23abf4b7d53def4ac5bf4394d7"}},{"ruleId":"D1","level":"warning","message":{"text":"deriveBits (cyclomatic 23): deriveBits has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c268c4afed473d987079d2e45920767bb4110d42ba3d7fe7805b186aba78f1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"__dispatchEntrypointQueue (cyclomatic 23): __dispatchEntrypointQueue has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 9 function items inside it that branch (retryDelay, decode, (anonymous)::retry, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5548}}}],"partialFingerprints":{"codehealthFindingId/v1":"141b28af78dd47fcc2de6a787223971046dc32f56e8bda2f51992cb4f9c64d82"}},{"ruleId":"D1","level":"warning","message":{"text":"basename (cyclomatic 23): basename has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f92fde954b5c4025e4004922156036dfa7ef125e3640582a66bb0b7f4bf6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"tee (cyclomatic 23): tee has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 495, makeBranch::cancel, a function literal at line 514, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"70698b6c27d7f4b33c82a0f18a7c01823e14f9afdcef94b16b2a267610947a42"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::read_d1_project (cyclomatic 22): celld::deploy::read_d1_project has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld::deploy::asset_content_type (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aba881e77c739d32e765f73bb085dea60b9a9b9ed7dac333228b42bd00a0c2"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::storage::transaction_control (cyclomatic 22): celld::storage::transaction_control has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c973513c011e3acbb594b1e71cf23e65922d50e704cb7e0cafd8f24ce27a48"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.createInvalidArgType (cyclomatic 22): node_util.createInvalidArgType has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa78c6367b703f0642fb0dd50e2c16c279265b4a6413ef0153aff2fdae6ac7c"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.parseMimeParams (cyclomatic 22): node_util.parseMimeParams has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dedbe2215cfa9d299af0797dcaa06e84365cc523d15297395b581de7da45719"}},{"ruleId":"D1","level":"warning","message":{"text":"exec (cyclomatic 22): exec has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 3 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":"crates/celld/js/harness.js"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d8aeacc5152961aaf6b4c2aac475d9cf96f353164843a26fa3117cf6796fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"__makeLoader.encodeLoaderEnv::project (cyclomatic 22): __makeLoader.encodeLoaderEnv::project has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"48775c08538228d04c2d1958673906b11f5d3c404728727c32e63ebb00f168ab"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeLogManager::maintain (cyclomatic 21): NodeLogManager::maintain has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":5687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21454c0bcd13dd5078c7fd7435e540e96a49d7f266de4abe581ac9087b85768"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeLogManager::uncovered_bundle_rows_for (cyclomatic 21): NodeLogManager::uncovered_bundle_rows_for has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":5941}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee2fe504873cc2508f34abedd519e0e1eaeebf7290a270ba417c3f789a7972"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__celld.__makeLoader.encodeLoaderEnv::project (cyclomatic 21): harness.__celld.__makeLoader.encodeLoaderEnv::project has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b353d092f7fb560fae1ce4374e2e136dd7a752ab24f8d586887221451fdcb03c"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.parseEnv (cyclomatic 21): node_util.parseEnv has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4b49568b98cac18f7189f77b6839e17c0de3463ad8b88cf655ba1edba1bd4d"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.getConstructorName (cyclomatic 21): node_util.getConstructorName has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d406e1c0c3a1a041db809fe8470d5a4122b09856ee255f59e65c53f262038"}},{"ruleId":"D1","level":"warning","message":{"text":"streams.ReadableStream.from (cyclomatic 21): streams.ReadableStream.from has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd29de643af21672fcd58b13c9528b57663462b43001375cfb21c81cb1e562f7"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 21): constructor has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2227fb91f33f7f2a5a7dfb585c7d6a3f3e9903631ddb95abaf7ef41bfd2ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"_settle (cyclomatic 21): _settle has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 7244, 7212, 7224, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":7197}}}],"partialFingerprints":{"codehealthFindingId/v1":"277778f23062ec9e3f26a6b16ca8ec1f713002deafba4dd4bf258cc56e57e26a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::__encodeStr (cyclomatic 21): (anonymous)::__encodeStr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb652fa49fd1d1f41dbf247fea1c485e0a8d13de2ccd28df341501d4cb63b47"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::__bufSearch (cyclomatic 21): (anonymous)::__bufSearch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bc83164001f1477a5be661fc57ebbc2aeb1afb418140f9234ef53ff076c7d6"}},{"ruleId":"D1","level":"warning","message":{"text":"parse (cyclomatic 21): parse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"5290e290f2e83365952611aa4126f09144630dfcd65e05ebd16e387ce23d151a"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::parse (cyclomatic 20): Command::parse has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/d1_cli.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6f900118d279306875c828632f1479cc5aada2b6c2ec23db0e1a3b723b63fc"}},{"ruleId":"D1","level":"warning","message":{"text":"FollowerStore::append_batch (cyclomatic 20): FollowerStore::append_batch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"029f2f236269be376046ecfd027ae40a6b317b41f12e7ab8112838b38e822f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::control_plane::validate_managed_module_envelope (cyclomatic 20): celld::control_plane::validate_managed_module_envelope has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"0095b376a9c79f2951d7df952013cc0d7a4af5d411302effd50cb4fb3bd9b36f"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::op_gate_acquire (cyclomatic 20): celld::js::op_gate_acquire has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2464e9f1fc07dc948a906678a061b06fac3a5e796ae32e45e1f1f8fe84c3ce7b"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::ltx_repl::compact_cell (cyclomatic 20): celld::ltx_repl::compact_cell has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b72a7ecde4de4f430d0d8f0415bb1b07abaa711f73c6e4bad9e99d4c42310"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::ltx_repl::sync_loop (cyclomatic 20): celld::ltx_repl::sync_loop has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2997a8932a08e37e092d9b6422e3a3c443e18fbeb375b1359379e19ff640443d"}},{"ruleId":"D1","level":"warning","message":{"text":"celld_logic::cron::day_of_month_matches (cyclomatic 20): celld_logic::cron::day_of_month_matches has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/cron.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0913e08ca102224f60c7880297a14df260442f39c89011221711f52c2e865ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocket.constructor (cyclomatic 20): WebSocket.constructor has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c744bc8f3fab0a33d4547a967b98aab55f85a96874ae835cc38658a0efd34173"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__finishServiceFetch (cyclomatic 20): harness.__finishServiceFetch has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd01366a2f143592874079c28398763434af1d2744d9054c50de2d0fbc9d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"node_path.normalizeString (cyclomatic 20): node_path.normalizeString has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"04214217305d86e4650a847af644647db1b7a9c430fdbace9a480e7d5d344c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.mapEquiv (cyclomatic 20): node_util.mapEquiv has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7c69e83ab41500df02bbf65023518f011d64b36d1d4dd302cb71624a6a4c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 20): fetch has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3881e60f869ee2aeb0ad5727ecfe0e37d3dbab087ed18c3783b6196c526c1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"__storedLift::lift (cyclomatic 20): __storedLift::lift has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4873}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ab5de8346f20d494d0822805b33a005964c7daf1671f275561d362fe34ebcb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::write (cyclomatic 20): (anonymous)::write has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"38870aca14e4f5c565ae3725ae3f8cbdb6717e615c661f5625e7997b5cfc989e"}},{"ruleId":"D1","level":"warning","message":{"text":"basename (cyclomatic 20): basename has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf002f8eca3e54105dcc1eef90b78a39bddcd45dacc280e71b7384fd9ae2db"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 16 function items inside it that branch (exec, toInput, constructor, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/url_pattern.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c94e2ce1bc270a7e20b92d2a1c7bf6f6286285378d33df4a528423653ffc1a"}},{"ruleId":"D1","level":"warning","message":{"text":"kvService::fetch (cyclomatic 20): kvService::fetch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a50082ee7bce40b1744bb2c7d96fcb34214e729353354b114402cc3e2ad54c"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::internal_log (cyclomatic 19): celld::internal_log has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d2450980cfdcc4d9657e97a189bcd3fe06db489a63d4581f3fe02bb5a32b35"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::node_log::spawn_maintenance (cyclomatic 19): celld::node_log::spawn_maintenance has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":6517}}}],"partialFingerprints":{"codehealthFindingId/v1":"12066c5f468f72dc6548dc76e8f829ca145f743e7359c9c7a7db91f0910b4607"}},{"ruleId":"D1","level":"warning","message":{"text":"State::expire_operation (cyclomatic 19): State::expire_operation has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: celld_logic::on_event (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d0d4c773f31a6b4f96ae9bc872c62c5031325265e8c38cde04fe760c0c3073"}},{"ruleId":"D1","level":"warning","message":{"text":"State::timer_fired (cyclomatic 19): State::timer_fired has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: celld_logic::on_event (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"70495373bf153276349d59303ef043f7168dc5f276f445de7cd2de07f976a179"}},{"ruleId":"D1","level":"warning","message":{"text":"State::owner_read (cyclomatic 19): State::owner_read has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld_logic::on_event (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760bb939ae733516b3610cf5b037f823b61bb77eb3791b9949f9c6eb2889b25"}},{"ruleId":"D1","level":"warning","message":{"text":"SubtleCrypto.exportKey (cyclomatic 19): SubtleCrypto.exportKey has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dcfc5513c996f6b93196dc13df3bd3244e2e82c3d602f82ab198f922c93bb2"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeBuffer.write (cyclomatic 19): NodeBuffer.write has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa78dcacdb134fbef3f3deaf87b5e4ad8699681a68f3f561390819b20813b2"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.improveStack (cyclomatic 19): node_util.improveStack has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"481cd4a12bc26bec9c963c19fb077e8454f1b76e4965cd3b8d36ec3a5c905c78"}},{"ruleId":"D1","level":"warning","message":{"text":"__makeServiceBinding::fetch (cyclomatic 19): __makeServiceBinding::fetch has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a1252dc9bfa2b12d8a540dc37222e0e0ae988e25bd94a03979c4b1cd5f15ad"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_drive (cyclomatic 19): (anonymous)::_drive has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bee0e6b2c5bbb51cbfb5c0552ca90a49e08f80596da7080fafc3b9807cd6f2"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::control_plane::validate_managed_class_migrations (cyclomatic 18): celld::control_plane::validate_managed_class_migrations has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0fbde7651e4ca7cb720d8914baa5aa3082686d321af449bd78032a88bdc2a7"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::env_vars::validate (cyclomatic 18): celld::env_vars::validate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/env_vars.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"90942db13e5e39eb653d933f31c2b5ae181a301268b7ab88267037c74e03b570"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::ltx_repl::bundle_loop (cyclomatic 18): celld::ltx_repl::bundle_loop has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"46656886827a39167ae012a93e7280255e122d5498d7105ab773b6455acfc66e"}},{"ruleId":"D1","level":"warning","message":{"text":"State::read_self_node_lease (cyclomatic 18): State::read_self_node_lease has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld_logic::on_event (cyclomatic 53) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb65a465cb08a58df4e05162c77c9ee39919a317526dc70b32b5d6c39cf2579"}},{"ruleId":"D1","level":"warning","message":{"text":"DurableObjectStorage.transaction (cyclomatic 18): DurableObjectStorage.transaction has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e7a2d9f9e41acdd2cdb24cd23d1674ff3291b3ae03bcb952c08006c8e4ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__r2Range (cyclomatic 18): harness.__r2Range has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"872c40e46c85b2fbdc676e5e0a3c66486fa6962b873d460b1acbfc337aaddd09"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__stubOp (cyclomatic 18): harness.__stubOp has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4626, 4647). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61868117d8603201498554cef8546894bcbd6e34aaa95182c40ea1d448a7c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__wfStepConfig (cyclomatic 18): harness.__wfStepConfig has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9af99f56953e2b800c6ede17941f61cbea74d3cd95975ea33ae5b631d5f84c7"}},{"ruleId":"D1","level":"warning","message":{"text":"TextEncoder.encodeInto (cyclomatic 18): TextEncoder.encodeInto has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/text_encoding.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a5d56cba58c8f4cd1e2856a1cf3a940ebb8a948d5c313df6344f5d016917cc"}},{"ruleId":"D1","level":"warning","message":{"text":"extname (cyclomatic 18): extname has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb53d0758c61109624d6786f77a0af9021907a40a69fbdc0f541e6788c2912f"}},{"ruleId":"D1","level":"warning","message":{"text":"InFlight::answer_settled (cyclomatic 17): InFlight::answer_settled has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"64733549f5f9dbb249dca126d43f511a1f6e7909ee1f411d73979c589e5a0da2"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::build (cyclomatic 17): celld::deploy::build 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. This is NOT this file\u0027s highest cyclomatic complexity: celld::deploy::asset_content_type (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b6e6050761f5eacc7df78c385113ed5c433c841c7c2ed0e7fc17bde965c59b"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::begin_cell (cyclomatic 17): celld::js::begin_cell has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7247251411041326fcfb6ac72e4d7769a4e19f90781159a8477fa083ddb8b981"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::js::op_loader_fetch (cyclomatic 17): celld::js::op_loader_fetch has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7708}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc25e634faad662a65f4090608a6fede72ff471410c588bc23f4a02350e04472"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::dispatch_forwarded_fetch (cyclomatic 17): celld::dispatch_forwarded_fetch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3aed7e1fff9b389bfd2b5c5bc1e40dd368cf3dee480318cf97147c89ddd2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSource._connect (cyclomatic 17): EventSource._connect has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/event_source.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6ead16b5ffbb6d4d490f610da3bd9bd77a37e33a31ca43a5b791b3f12d21f9"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__wrapServiceResponse (cyclomatic 17): harness.__wrapServiceResponse has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"88052b80f84611b91571b03a154a4f52900e3f73077472dd78ba5da536b5c731"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__celld.__installLoaderEnv::revive (cyclomatic 17): harness.__celld.__installLoaderEnv::revive has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8fb30e7250ac451ba12f9d014b09f96971ddc9ed220951e6dd8043d1b4ec62"}},{"ruleId":"D1","level":"warning","message":{"text":"harness.__celld.__readResponse (cyclomatic 17): harness.__celld.__readResponse has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c7c7cc03a8f659f40c93cfc61e6ad4f498ae30622037102c0bb7a50e34f68"}},{"ruleId":"D1","level":"warning","message":{"text":"node_assert.inspect (cyclomatic 17): node_assert.inspect has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e5e4ce8d1981a688bcf96f29512fded0ea3051f05ee78f0ade3fa7fc2424d5"}},{"ruleId":"D1","level":"warning","message":{"text":"node_events.EventEmitter.emit (cyclomatic 17): node_events.EventEmitter.emit has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"588ba96602fff9eb778bf5fea18a19dacb3ee8a77d39843ad6f6208999ac3037"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.reduceToSingleString (cyclomatic 17): node_util.reduceToSingleString has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1ed672a876f20ae2df82ca4e633ecf3433d761c0e251d09629fc62c7bf135b"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.setEquiv (cyclomatic 17): node_util.setEquiv has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a151412d7d698cb2f600397fd5009dcb381e1b53ad4b9dd4c7d1990740bb8808"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.objEquiv (cyclomatic 17): node_util.objEquiv has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fb70b39027ecd3d79a6405a4bc20aaf4055dcfbd3689b1138f940319a730c5"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.styleText (cyclomatic 17): node_util.styleText has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5863a21a51a39ad47d4e3a3872b444a80c1d7997ea85f10b8d5e1b4f05e46fa"}},{"ruleId":"D1","level":"warning","message":{"text":"__makeR2Bucket::list (cyclomatic 17): __makeR2Bucket::list has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcd60d2d3da399c22d7bd1230d0010c7937f1c8c6942449e23082479e483b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"addPrototypeProperties (cyclomatic 17): addPrototypeProperties has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3440892414459663f1e4c2e8670294971953a46a732c53aeadc34b1ef5186f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeManager::stop_cell (cyclomatic 16): RuntimeManager::stop_cell has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df2e1b0bc621ddfd6492e923338f3679e51b123bcb7eed116cff0eeb72990f7"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::assets::parse_redirect_rules (cyclomatic 16): celld::assets::parse_redirect_rules has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29d021d34744292a72b295bff593b08624504c1db273269f5801734cf9d4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::collect_asset_files (cyclomatic 16): celld::deploy::collect_asset_files has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld::deploy::asset_content_type (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"45198d05769e8471918cf6b42fbdd396629ae60e98c1c47487573b9594f01742"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::deploy::strip_jsonc (cyclomatic 16): celld::deploy::strip_jsonc has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: celld::deploy::asset_content_type (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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"103a22fbbba8e3a0ba432a9fa61236125957c706c68d993d154f8c0fd1dfe2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::main::websocket::handle_websocket (cyclomatic 16): celld::main::websocket::handle_websocket has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"5905fb2dda4eaef4270c7f0ebb6c0e6741a3261e84eb008aec71ff495334bcdb"}},{"ruleId":"D1","level":"warning","message":{"text":"celld::storage::d1_run (cyclomatic 16): celld::storage::d1_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. This is NOT this file\u0027s highest cyclomatic complexity: celld::storage::authorize_sql (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c82944a30e5d2b39b16a0f280906dedd38d1ec894a2f6a9ee77ce19c2159f"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketCloseScanner::observe (cyclomatic 16): WebSocketCloseScanner::observe has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/schedule.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c9912b701eb77a687a138add5d28fa5e9bdfd05485d42e8507cf38f9227fb"}},{"ruleId":"D1","level":"warning","message":{"text":"__WorkflowCell.alarm (cyclomatic 16): __WorkflowCell.alarm 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9005}}}],"partialFingerprints":{"codehealthFindingId/v1":"38412f201279e4e288e1d0f44ae48777825362374667af18ce5f1c647b5523dd"}},{"ruleId":"D1","level":"warning","message":{"text":"EventTarget.addEventListener (cyclomatic 16): EventTarget.addEventListener has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9733}}}],"partialFingerprints":{"codehealthFindingId/v1":"650893468b5b270bdd29089a606517964056071bbd2d9e9f378e5f24190995a6"}},{"ruleId":"D1","level":"warning","message":{"text":"html_rewriter.__hrService (cyclomatic 16): html_rewriter.__hrService has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db2f13908951d35e779a7fd505b7992086e9cbe8a978a3cfde3111cf0ac6af9"}},{"ruleId":"D1","level":"warning","message":{"text":"node_util.getOwnNonIndexProperties (cyclomatic 16): node_util.getOwnNonIndexProperties has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e31ed17220eb5d397383e35e5ea6f1f38d3de97b14868c31ec3a01201f1c89"}},{"ruleId":"D1","level":"warning","message":{"text":"__KvNamespaceCell.fetch (cyclomatic 16): __KvNamespaceCell.fetch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6544141f0a4e56f479be945bbf8a14d37e5b71cf62b3251ef2cd9849a4d6e1"}},{"ruleId":"D1","level":"warning","message":{"text":"_blockConcurrencyWhile (cyclomatic 16): _blockConcurrencyWhile has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f92c36be40c49ebb33bbcdf48a43ea35fe9d350b8d9d190d6a089c88b63f61"}},{"ruleId":"D1","level":"warning","message":{"text":"__makeLoader.makeEntrypoint (cyclomatic 16): __makeLoader.makeEntrypoint 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 10 function items inside it that branch (fetch, get, a function literal at line 3266, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fc4c007429cc04dfe48e7e826cee4918758722b79756cf5fcefedde88e715f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::byteLength (cyclomatic 16): (anonymous)::byteLength has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6abf6bef5e8cfc26c910ca0fb9186e191ad9cf6dfcfa43b8e4a6d789169d13"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::transcode (cyclomatic 16): (anonymous)::transcode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae557328135529973458e05da12ce8c27fb8ffb751d215c59708b59f6c772def"}},{"ruleId":"D1","level":"warning","message":{"text":"join (cyclomatic 16): join has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dba58dc925b8eabba084da32f53b3e05f25f1c11aa7fc0c67b8da52fcfad47"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 16): constructor has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 10 function items inside it that branch (pull, write, a function literal at line 76, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/sockets.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc78b5be66964fb629ccb04e1b8d98639bdb980ede244fe94bc027891ced729b"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 16): constructor has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 13 function items inside it that branch (runCancel, cancel, write, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/writable_stream.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6fb0eeb304570812b4cecb1038e8c3c815e67fdb726d345e5eb864c39bceab"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::async_main (cognitive 402): celld::async_main has cognitive complexity 402 (threshold 15). Drivers by points: if/else 123 (283 pts), match/switch 30 (73 pts), boolean chains 23, loops 14 (23 pts) (nesting depth added 212). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"748685aad34f16b1ca4776df9a70afcedd120d687f37b7cf39e6668c56cf3ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor::execute (cognitive 166): Actor::execute has cognitive complexity 166 (threshold 15). Drivers by points: if/else 47 (102 pts), match/switch 14 (34 pts), loops 7 (22 pts), boolean chains 8 (nesting depth added 90). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4428bcd950d8f48da7a82165146c122d9d2b97b71bb371211645be4976d40ef"}},{"ruleId":"D2","level":"warning","message":{"text":"formatRaw (cognitive 160): formatRaw has cognitive complexity 160 (threshold 15). Drivers by points: if/else 57 (100 pts), ternaries 12 (33 pts), boolean chains 25, error handling 1, loops 1 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9179c939a40f457885b4ed746f23a0b4536e0a3fe5bb9e5e61206eac16d58b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::read_project (cognitive 146): celld::deploy::read_project has cognitive complexity 146 (threshold 15). Drivers by points: if/else 63 (100 pts), match/switch 14 (19 pts), loops 14 (18 pts), boolean chains 9 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0df3fde1aed12a9014fe014db9f9a53100fda4d62eb29615c8892aa1b7679"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::runtime::wake (cognitive 131): celld::runtime::wake has cognitive complexity 131 (threshold 15). Drivers by points: if/else 26 (69 pts), match/switch 14 (58 pts), boolean chains 3, loops 1 (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3800527124c11e06b535214ac6000eb3aa426c9ba8f3c37256cb5ba34fd6b4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"State::validate (cognitive 127): State::validate has cognitive complexity 127 (threshold 15). Drivers by points: if/else 51 (90 pts), loops 17 (19 pts), boolean chains 14, match/switch 2 (4 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5096a2c6d35e445fc066e9b7b15859c64983789f095d6b41d058c6499eab9ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::recover_serial (cognitive 126): NodeLogManager::recover_serial has cognitive complexity 126 (threshold 15). Drivers by points: if/else 26 (80 pts), loops 9 (24 pts), match/switch 5 (15 pts), boolean chains 7 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":4919}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b97fd7725bf57130c949effedebccfe6bfd4b3114134ab924a21820cddf8c"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::ltx_repl::ship_loop (cognitive 121): celld::ltx_repl::ship_loop has cognitive complexity 121 (threshold 15). Drivers by points: if/else 26 (69 pts), match/switch 9 (28 pts), loops 9 (20 pts), boolean chains 4 (nesting depth added 73). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"63316db1e71df155474ae8ef0e87ee02c0bfa2b4d654cebe0c382dd24672e79b"}},{"ruleId":"D2","level":"warning","message":{"text":"kv.kvService (cognitive 110): kv.kvService has cognitive complexity 110 (threshold 15). Drivers by points: if/else 43 (55 pts), boolean chains 23, ternaries 13 (15 pts), loops 10 (11 pts), error handling 4 (5 pts), match/switch 1 (nesting depth added 16). Of this number, 91 points are the body\u0027s own statements and 19 belong to 5 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d46dc2e83801a13ed510056d01c7c4d7200d66b6700bae3b5ee80e89027fee"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::node_log::stream_lane (cognitive 109): celld::node_log::stream_lane has cognitive complexity 109 (threshold 15). Drivers by points: if/else 24 (62 pts), match/switch 15 (34 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 62). Of this number, 89 points are the body\u0027s own statements and 20 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee92e9d37c68906d19e4283498627bca9f9df33ae6b38ecbe85a2d0948c55e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolve (cognitive 86): resolve has cognitive complexity 86 (threshold 15). Drivers by points: if/else 23 (58 pts), loops 4 (16 pts), boolean chains 11, ternaries 1 (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1845c90d6c2ccf07c7ea0f204bc93d7e773a8cf54582b9846a71f2a3afbce5"}},{"ruleId":"D2","level":"warning","message":{"text":"innerDeepEqual (cognitive 86): innerDeepEqual has cognitive complexity 86 (threshold 15). Drivers by points: if/else 37 (60 pts), boolean chains 20, ternaries 3 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8c57fae83edf89a91b19448f5083b36b9da853e78831e3125f1a948e5bb75e"}},{"ruleId":"D2","level":"warning","message":{"text":"FollowerStore::read_tail (cognitive 84): FollowerStore::read_tail has cognitive complexity 84 (threshold 15). Drivers by points: if/else 14 (56 pts), match/switch 4 (15 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 57). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a8a7e9139639b3ca4f1df94beef0aa338b09e61bb4f4aba6fda281f57cdd9"}},{"ruleId":"D2","level":"warning","message":{"text":"__parseFormData (cognitive 81): __parseFormData has cognitive complexity 81 (threshold 15). Drivers by points: if/else 23 (45 pts), ternaries 8 (19 pts), boolean chains 10, loops 4 (7 pts) (nesting depth added 36). Of this number, 74 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10112}}}],"partialFingerprints":{"codehealthFindingId/v1":"107686be4a8bbe8194924a9f799dad47d46b4193a20cf1615351ef0e306100df"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 74): (anonymous) has cognitive complexity 74 (threshold 15). Drivers by points: if/else 49 (55 pts), boolean chains 8, loops 4 (5 pts), error handling 3, ternaries 2, other 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 74 points is its own statement and the rest belongs to 33 function items inside it that branch (_cancel, _pullInto, _errorRd, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/identity_transform_stream.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"43402f998a01a6ea2d1b7f30cc53550fafef469a1d6426d042064150e3641bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.parseEnv (cognitive 73): node_util.parseEnv has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (66 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852615406ee6c00a83ac9bceb62d6759370b9a7be0350b150c78edd1e61f074"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::dispatch_do_call (cognitive 71): celld::dispatch_do_call has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (51 pts), match/switch 7 (17 pts), boolean chains 2, loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee4aa1a94a779896c55755482777c90edd818dc51787ed440cb53cf1a065573"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 71): parse has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (49 pts), loops 4 (13 pts), boolean chains 9 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da8c4e87d6ed511a47b4edd8042e8df600aa731b6cf73fb20cc91b7081b808"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::op_loader_load (cognitive 69): celld::js::op_loader_load has cognitive complexity 69 (threshold 15). Drivers by points: if/else 26 (48 pts), match/switch 10 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa56b3481a7855281b1a05618aebee5a18371f20b15ba5fc2d252aa7ca34350"}},{"ruleId":"D2","level":"warning","message":{"text":"relative (cognitive 67): relative has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 7 (8 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14142605a8d1ad94155d6272eb6fd5d8736fbfb7d508a14d21fb9df0032717b"}},{"ruleId":"D2","level":"warning","message":{"text":"formatWithOptionsInternal (cognitive 65): formatWithOptionsInternal has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (53 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4706980cf082d000afcfa179155c9630183a75aead7b3d137ad4e3f07b0d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::crypto::crypto_operation (cognitive 62): celld::js::crypto::crypto_operation has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (41 pts), match/switch 11 (20 pts), boolean chains 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a6895c09908fd9fc66528c526bf9d2df7705f593592a68a453923960a6b9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"__stubLift::lift (cognitive 60): __stubLift::lift has cognitive complexity 60 (threshold 15). Drivers by points: if/else 30 (44 pts), boolean chains 8, ternaries 3 (5 pts), other 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74515dd9d3d0e5f9bbe3666d34033aa8399e9f64e8dbb1f08355cc66c24709a"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::storage_ops::op_sql_cursor_start (cognitive 58): celld::js::storage_ops::op_sql_cursor_start has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b4fa67c8e77f5148207cfe95722f4862fe7948d1dd348cfae743b062a75f3"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize (cognitive 56): normalize has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (12 pts), boolean chains 9, ternaries 4 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdc0a81a13c55625543b9a83c149317bede772bccfe3369bff96f2feadad2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"dirname (cognitive 56): dirname has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 4 (13 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c5685e0a19a6ba8e33041f8c01bfaf91eae2773cb5a876aa50b1a0eddedbf"}},{"ruleId":"D2","level":"warning","message":{"text":"deepEq (cognitive 51): deepEq has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (35 pts), boolean chains 11, ternaries 2 (4 pts), loops 1 (nesting depth added 12). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c336451e1a2c9214aa233446b36a610737d1a6f603897ac5f53e12134d9a6e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::apply_deployment (cognitive 49): celld::control_plane::apply_deployment has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabfdf092fa030d8a098cb0356e82b8b791a464b765ea52cfe67399b817586b6"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::runtime::drive_cell_inner (cognitive 49): celld::runtime::drive_cell_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (30 pts), match/switch 8 (16 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd801ea9578a767e47db89b7de4b40abed208fe93a211a47c44b13ce41892004"}},{"ruleId":"D2","level":"warning","message":{"text":"formatValue (cognitive 49): formatValue has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (10 pts), boolean chains 6, 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":"crates/celld/js/node_util.js"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8081ce160347351a51fe5a740e4e5f7fe852ed3370763c6f016850666e2030"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::op_fetch (cognitive 48): celld::js::op_fetch has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (25 pts), match/switch 12 (19 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8990}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ec70b872d6e1f5485f741dc28f591dc51751cb8ed985e7c70abe5329972319"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeString (cognitive 48): normalizeString has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"080031d49fe6dec8e997b7852678a89b4faa1f32388af06b092b36072ca10b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"basename (cognitive 48): basename has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f243b654fc37e6b2aca296bd04520cf967a05ff2785b079ff5b8f9acaa4ed946"}},{"ruleId":"D2","level":"warning","message":{"text":"LtxRepl::activate_with (cognitive 47): LtxRepl::activate_with has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 4, loops 1 (4 pts), match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafeb6f163c10c62c5fde9e80de991176e88a94d5233090a3be1cacd2c0c4702"}},{"ruleId":"D2","level":"warning","message":{"text":"generateKey (cognitive 46): generateKey has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (28 pts), ternaries 3 (8 pts), boolean chains 6, loops 1 (3 pts), other 1 (nesting depth added 23). Of this number, 43 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d30c5cdbcacda8c642b260345dbacc13c003bad89e824b6b35c6d2aa70d699a"}},{"ruleId":"D2","level":"warning","message":{"text":"basename (cognitive 46): basename has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1b7aff8b2310c4aa69aa6550f95c64cca866659ca1bfc8cac73aeb8b38643a"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 45): constructor has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 21 (22 pts), if/else 15 (18 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbed0688e8c156a4639ac32a1f4cd60a67026922c959be8ae0723bf9d5a3d267"}},{"ruleId":"D2","level":"warning","message":{"text":"groupArrayElements (cognitive 45): groupArrayElements has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 6 (14 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f30a9a7637a01bd4bb0baf69e34130942c35666341fdf0ba2c128976a3bba3"}},{"ruleId":"D2","level":"warning","message":{"text":"keyCheck (cognitive 44): keyCheck has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac6ebb75a7e98f9d62b3766221bfeac95a2149308fb3904f4938f57edd1fb90"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetResolver::response (cognitive 42): AssetResolver::response has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (35 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fe8132e7908e1c671c9ba4c8f6d8490dc2966e5dfb35f0af31be327c9bf3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::ltx_repl::sync_loop (cognitive 42): celld::ltx_repl::sync_loop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (9 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc128959477e56bb413dd3396c421e8bd56d2e52287ce18a4184f3c97e556a9"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeTo (cognitive 42): pipeTo has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 8, error handling 4 (5 pts) (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 26 belong to 20 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"868d079959b88c43cd519a5df845936ad8101681254378bda32af74b85cf7df6"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::html_rewriter::run_rewriter (cognitive 41): celld::js::html_rewriter::run_rewriter has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 5 (12 pts), loops 3, boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d73f70a2f367242ae77740eaa6873c724eae25d9012397e6bdf51549f7533bb"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::handle_internal (cognitive 41): celld::handle_internal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 5 (10 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e5322537997706b6d7cf5b648bf290d57d8198a6cd37c520ac0b8858dffefe"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::sql_cursor_start_values (cognitive 41): celld::storage::sql_cursor_start_values has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150cae2647b3f539674a749e4a99204cabba1b4a321828e08648f00cb235a20"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeLoader.encodeModules (cognitive 41): __makeLoader.encodeModules has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 7, ternaries 3 (7 pts), loops 1, other 1 (nesting depth added 14). Of this number, 39 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eb94e4d7708b9f7206fd7fa2e7b54321daef111ef7780a88c410ad1cb0031b"}},{"ruleId":"D2","level":"warning","message":{"text":"formatProperty (cognitive 41): formatProperty has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 4 (10 pts), boolean chains 9, error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2747a77c7a7ef649515887cfd9dc2bf657675ff247ec90a0ca034437b1b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::handle_explorer_request (cognitive 40): celld::control_plane::handle_explorer_request has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 9 (16 pts), boolean chains 3 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e709ddf3a777c4230f8845c11d7d492ca2c30f2b602bc78d3bc5cdc40bd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::read_bundle_config (cognitive 40): celld::deploy::read_bundle_config has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (7 pts), match/switch 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":"crates/celld/deploy.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba569d0680b9db0a6fcd5af58c525628a86433218a99c4279aae6c39b16336b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::ltx_repl::bundle_loop (cognitive 40): celld::ltx_repl::bundle_loop has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (9 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef7db7c67cfe05202d89eb29377b71685c1254b65256376000eb7370c86f32f"}},{"ruleId":"D2","level":"warning","message":{"text":"mapEquiv (cognitive 40): mapEquiv has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ee3676e9ce55920d37f1734f9f99eb88db02b8b9901d9446b8c1257a6293b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::load_config (cognitive 38): Worker::load_config has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 7, loops 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a6af35e0535939fdb7c83081f5d84530056f76b238e0b549403c9b637ff4a0"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::uncovered_bundle_rows_for (cognitive 38): NodeLogManager::uncovered_bundle_rows_for has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 5 (11 pts), loops 7 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":5941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a995600c7ed848d2767b7ea07b5d36bc08b706e8ce02794b0a28a8104f3b5607"}},{"ruleId":"D2","level":"warning","message":{"text":"createInvalidArgType (cognitive 38): createInvalidArgType has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (33 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb7bd1288fc620f44492a06b38ec055f6a506fe891549d8a6f2626340dc0bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::read_d1_project (cognitive 37): celld::deploy::read_d1_project has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d381beab9c41701b9653f31793ca95acf3a6c5e5f47e377963c506f48dc5a"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::node_log::spawn_maintenance (cognitive 37): celld::node_log::spawn_maintenance has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (8 pts), loops 4 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":6517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e767a4086f0ccac521d893070a0c93917fc6b22beb68efe66f037b0f65c7517c"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableObjectNamespace.get (cognitive 37): DurableObjectNamespace.get has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 9 (12 pts), boolean chains 9, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 7 of the 37 points are its own statements and the rest belongs to 4 function items inside it that branch (doFetch, invoke, a function literal at line 5263, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168120e118cb5a405df548d9139dc284f372169c1f457d5ebcfe5fea58ffb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::__encodeStr (cognitive 37): (anonymous)::__encodeStr has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 4 (12 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"26191df40324d6095920d75d1409930006bbc85ec261df64c23b2a077bae5883"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::assets::validate_index (cognitive 36): celld::assets::validate_index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe8613a9137f5ab1943566fb65a3161f033f2d929f87fcacb180ac95eecfd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.objEquiv (cognitive 36): node_util.objEquiv has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42ebf7b5ea3b441803b3f17d2c22c78f15ce4497ebb1dd900b0f1ff667f22a0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::from (cognitive 36): (anonymous)::from has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 13, ternaries 1 (2 pts), other 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23cd8596a7359eb31f5664c160637b2538e85786e7691207ab9c9947eb513ac"}},{"ruleId":"D2","level":"warning","message":{"text":"relative (cognitive 36): relative has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6, boolean chains 5, ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d5bd94c240f51bb2c7e057acf52211ea6bbbca0b4caf6c99d5a1f6055bdb7"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::dispatch_forwarded_fetch (cognitive 35): celld::dispatch_forwarded_fetch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 4 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b665fc69e98a8c6f99805284fb53ba65e76f0011eea4affa888aa4a8302547"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::node_log::serve_log_stream (cognitive 35): celld::node_log::serve_log_stream has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 3 (9 pts), loops 4 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dec5fcea66bc23b320cd3ba731f1adef06fde32317062f963a165f6fd214e88"}},{"ruleId":"D2","level":"warning","message":{"text":"__rpcProject::project (cognitive 35): __rpcProject::project has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 21, if/else 7, loops 4 (7 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7366e7c7a325a77c65265a34028f3b4d54f71ca35f912de61993ad06828f75fd"}},{"ruleId":"D2","level":"warning","message":{"text":"_leaseBatch (cognitive 35): _leaseBatch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 4 (6 pts), boolean chains 5, ternaries 3 (4 pts), other 2 (nesting depth added 8). Most of this is not in the body itself: 11 of the 35 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 6883, 6865, 6818, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":6800}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e663c80adcb95bc232c643f45d0c8e2a78797832e0f0155f1a56acda75678e1"}},{"ruleId":"D2","level":"warning","message":{"text":"__wfMakeStep.doStep (cognitive 35): __wfMakeStep.doStep has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 8 (9 pts), boolean chains 8, other 4, error handling 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 8467, 8514, 8552). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d640f61cf560bd117a095e488a3015c23be9086342317b1fc3d40dca95508ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"reduceToSingleString (cognitive 35): reduceToSingleString has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 5 (12 pts), boolean chains 4 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18b226bfe73392037955de2281ba7a12e192461fb64efccd872d0d67425d5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"tee (cognitive 35): tee has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 12). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 495, a function literal at line 514, a function literal at line 528, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a8e1da7422a7e5a63b7e28191e7d13e2063b7eb8a862d22f37d824c69ee0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::bucket::azure_builder_for (cognitive 34): celld::bucket::azure_builder_for has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 9, match/switch 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"48094aac8bffab579d04e947fa33b298d47a75cca2e64cb009e55fe4b927b7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::kv_cli::run (cognitive 34): celld::kv_cli::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 6 (10 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d760f3c73425664fe0f6f8270ff12f49d0ab5eb45ea3cdb8812eac7c895317"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::op_gate_acquire (cognitive 33): celld::js::op_gate_acquire has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 4 (10 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8265ac90274fcb8be6737cedb1e66f8c4f8ec376076b380d98129e2aa429ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"__WorkflowCell._drive (cognitive 33): __WorkflowCell._drive has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 9, error handling 1 (2 pts), ternaries 1 (nesting depth added 8). Of this number, 26 points are the body\u0027s own statements and 7 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"49874936535634c63d2040a6bd4081ee149f7bec73bde4d8d5948615f18ef918"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeBuffer.from (cognitive 33): NodeBuffer.from has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 11, 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":"crates/celld/js/node_buffer.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c19e1a145f59ff4f5341a2eb73851e64480d059c6d14d39779b09a8ee26a23"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.parseMimeParams (cognitive 33): node_util.parseMimeParams has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (11 pts), boolean chains 8 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1170b18b4711b86a621717bcfdde40c05fc3a289a424496aec1bf6b15be78e3"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__stubRevive::revive (cognitive 32): harness.__stubRevive::revive has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ee41386a412b22d03ea41248979df9cb6946f8323448a8d6b1efbaeb096695"}},{"ruleId":"D2","level":"warning","message":{"text":"URLSearchParams.constructor (cognitive 32): URLSearchParams.constructor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (9 pts), boolean chains 3, 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":"crates/celld/js/url_search_params.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a2b2814b18c22272571d145b26ef5d6a21903b934aed5ee4b718444652f5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::parse (cognitive 31): Command::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bc64d1d13e4631b68cee4f2f25d6011725316fcc87294077ccbaae11e3f439"}},{"ruleId":"D2","level":"warning","message":{"text":"FollowerStore::append_batch (cognitive 31): FollowerStore::append_batch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b2a97a851a68dfd5216588ff2fc4a444286784098c9133a3da3381bf7dfc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::parse (cognitive 31): Command::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/r2_cli.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c2e5634d86ecdb9f87c78b30bf4206ef78a674cde7764e633d618cbfe275d5"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::d1_step_to_done (cognitive 31): celld::storage::d1_step_to_done has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"157466ddb3cd404d3bd9e0c48d3f0c80464c00718af51e40195035564220ed9b"}},{"ruleId":"D2","level":"warning","message":{"text":"State::alarm_observed (cognitive 31): State::alarm_observed has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 9, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"51898924f95f76ad046e6c9c9600adff0dc90d892c0eec04410ec44eec675e69"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__makeLoader.encodeModules (cognitive 31): harness.__celld.__makeLoader.encodeModules has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dac58b92a49ab9676f4e6df0b8cd523571060207b018ea08cd5212ca515b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.strEscape (cognitive 31): node_util.strEscape has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4778afe74e502fa380dcfbb27f423b69d2e1932f317759d7539e8f20d06e1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 31): constructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 5 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f989a7b5d3058d63b57e82ea4f77bb908e7336cdd3f86c2838441ab3acb5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::fill (cognitive 31): (anonymous)::fill has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6, ternaries 2, loops 1, other 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef61cfa1116a8034935a3b8800b507202d78b05da48ea66b9ef61f97a5302d2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::write (cognitive 31): (anonymous)::write has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 1 (3 pts), other 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e91d38178bd4e41d76aa87998dc9d3940b934034b465fd313af7deeb2020315"}},{"ruleId":"D2","level":"warning","message":{"text":"addPrototypeProperties (cognitive 31): addPrototypeProperties has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb60bc80dc83beead173a2e0e289bb699d7d703a8eb9e587c03345d26d0e972f"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__wfMakeStep.do (cognitive 30): harness.__wfMakeStep.do has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 8 (9 pts), boolean chains 6, error handling 2 (nesting depth added 6). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 8467). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5f2fa9938a67f6643971b07a74c7e80520d95e8824b71f3eba7c7e911e72b2"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeBuffer.write (cognitive 30): NodeBuffer.write has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7594594017c88103150168d5f6bf31aa686582999dbfec9bdc45a2b919eec7"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.setEquiv (cognitive 30): node_util.setEquiv has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb35c59a27ea7ae58dcec2f39dc5888ceaaf25fcb9f80c573c2eb69b38c7156"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpStreamService::checkout (cognitive 29): HttpStreamService::checkout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e97ed0998deb118a540f6161aa3e302f2b7f20f2eb903d02c7c0845f79fde34"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::d1_run (cognitive 29): celld::storage::d1_run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff72c51bf15209bbe637da648a3119a6c96c1494b4040759ddd070bf6baa77"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__makeR2Bucket (cognitive 29): harness.__celld.__makeR2Bucket has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 10, boolean chains 6, loops 2 (nesting depth added 1). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d098dea96d1450465f221c524e7feaa0bb061adce5a4e8beb94a4f78c7021671"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__retireInputGateContext (cognitive 29): harness.__celld.__retireInputGateContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 15). Of this number, 28 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":"crates/celld/js/harness.js"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"09130c96908ded85ccb028577d89423cb69ae29d00fd80f9ac67938c54b9ce8b"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 29): parse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fca972554393bb98a3924e6ebb443b7f5577eaff87680aedba0fb560cd77fa"}},{"ruleId":"D2","level":"warning","message":{"text":"getConstructorName (cognitive 29): getConstructorName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a01a5d08ae128f576d1d2e2b91ef2bfe640e496b616c4f75e19e7d54ff1d379"}},{"ruleId":"D2","level":"warning","message":{"text":"isFullWidthCodePoint (cognitive 29): isFullWidthCodePoint has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 29. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c46b7509a22a76460905a8aff707fa22e30a2da490d7de8de12304c6e032246"}},{"ruleId":"D2","level":"warning","message":{"text":"DeploymentGraph::load (cognitive 28): DeploymentGraph::load has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/generation.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fcd295f8ec774f1584305694a7d754013a78042a39151072b8098ac8bc8b27"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::strip_jsonc (cognitive 28): celld::deploy::strip_jsonc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8d05d0dad917a32891b619bd6fd44e147e87212b579495251f17f57c939942"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::internal_log (cognitive 28): celld::internal_log has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 8 (11 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f89f9ec16ac10d6ba0d5dd575562db323eb72f2ea105f3cb9db5d6577b2b0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketCloseScanner::observe (cognitive 28): WebSocketCloseScanner::observe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/schedule.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2f8a79d6f52a38ff67db35c220a2246d68d6617b388060a91b57c9066d462"}},{"ruleId":"D2","level":"warning","message":{"text":"deriveBits (cognitive 28): deriveBits has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, other 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"61363b967b20201f9ce86e0d7753dc2ee8105a3e070588b603b815e3f1771847"}},{"ruleId":"D2","level":"warning","message":{"text":"exec (cognitive 28): exec has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (2 pts), other 1 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"841acb573627c414992d77d38b2494148fe160ed351f86392b6ed9bd5a6be57f"}},{"ruleId":"D2","level":"warning","message":{"text":"join (cognitive 28): join has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f6bf9ee5fada3513f44c4fdd3714fdb7bc89cb07813fb8be88aa3dcf0dc427"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, error handling 2, 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":"crates/celld/js/streams.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d1452213fdc28666fdbd370069c82697c15d30ed0bc21d8d3990a8437fe6d"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::validate_managed_class_migrations (cognitive 27): celld::control_plane::validate_managed_class_migrations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd88691ffa449b65bb595a494f362dfda0a7be46f5bfe750dc0ace699e892c8"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::main::websocket::local_websocket_pipe (cognitive 27): celld::main::websocket::local_websocket_pipe has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0167ba84592765218bbd20d504de7ef045d392c246841b63f66eec25ed4018b"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeBuffer.fill (cognitive 27): NodeBuffer.fill has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a626a66533b5dcf1ded32c613dc2ce33534c4e39adc6e145c18b7fc6999e84"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpStreamService::begin_activity (cognitive 26): HttpStreamService::begin_activity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89a54e5f83c2ebe78a5a120ed83d28e2d8081c7b11492604952abe79c159ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::gc_bundles (cognitive 26): NodeLogManager::gc_bundles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":6285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd5b0f52566c1d819017bc7a248a18c180942f4de40f857dd02912a55a76ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::sweep_dead_leaders (cognitive 26): NodeLogManager::sweep_dead_leaders has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":6394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d547ba9daf7ea2bbe2e94a7f95a50764e1c63dad9c8e2e202ad1d68edbb0df8"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::wait_for_approval (cognitive 26): celld::control_plane::wait_for_approval has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd2e48c91805dde5abc284bfb33934db34061ecb547a299d9e920c32788ae40"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::main::websocket::pump_cell_socket (cognitive 26): celld::main::websocket::pump_cell_socket has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (8 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7234c1c7c3d63e338f95485081e395ff25e6df1a6b5271a95b20cad26122252"}},{"ruleId":"D2","level":"warning","message":{"text":"SubtleCrypto.importKey (cognitive 26): SubtleCrypto.importKey has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 9, if/else 6 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"654e5c83c2f95f39b38634b62a3a87e50201d9507dcdff4477f44488363fd5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"__WorkflowCell.__wfRestart (cognitive 26): __WorkflowCell.__wfRestart has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 12). None of this is in the body itself: all 26 points belong to one function literal inside it that branches (line 8904). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6952f00e673984189139347d68802742e8178984c4b03b5f6f1cbdabfc0c44"}},{"ruleId":"D2","level":"warning","message":{"text":"_rearm (cognitive 26): _rearm has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8, ternaries 6 (8 pts), other 6, boolean chains 4 (nesting depth added 2). Of this number, 24 points are the body\u0027s own statements and 2 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":6519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de42c9e807a70f54d9de6d77cd9beae0b99eeae5f06543059ed6e7e87e9ffd1"}},{"ruleId":"D2","level":"warning","message":{"text":"encodeInto (cognitive 26): encodeInto has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/text_encoding.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7adac221b6a942b902a642d13368f59cedf12368756722e7061ee5aa6e563"}},{"ruleId":"D2","level":"warning","message":{"text":"PreservedCache::prune (cognitive 25): PreservedCache::prune has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (7 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/replication.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fd52e1695f65055804a87689a7746c8a06d5b82c0bcdb5491c012e6cdc253e"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::d1_cli::run (cognitive 25): celld::d1_cli::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (9 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/d1_cli.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c34e0141590c1d962b1dacbb71d83f508e5a3ea51c576b9cdc44a34474f605"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::dispatch_rpc_call (cognitive 25): celld::dispatch_rpc_call has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5 (9 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c68a505db92183bd367894e5dfdca95a9bdca3c61076b2177d44ff7c487744"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::main::cli::action_from_process (cognitive 25): celld::main::cli::action_from_process has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc6c9d8d5ff98e36e2f3ddc45d5fced9df0da065d38bf8f5e117c02f8f030f9"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__rpcWalk (cognitive 25): harness.__rpcWalk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2862b113301db0061b68996715456924cf94d890bdc2dea37bc051d90f60a1"}},{"ruleId":"D2","level":"warning","message":{"text":"node_events.EventEmitter.emit (cognitive 25): node_events.EventEmitter.emit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a74c462fedd967e8fbfc70c1f29479f3134302c770355b55fdd64cfd0caa56"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.inspect (cognitive 25): node_util.inspect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"808db492bff3c4131468c3bf98d53e36ccdb5ad768cf71c34cb2260a4c468208"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::__bufSearch (cognitive 25): (anonymous)::__bufSearch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d54ef2d0691456a9faae0d9a9a48139c622db00b19fd53c1b7d3264015c526b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::validate_managed_module_envelope (cognitive 24): celld::control_plane::validate_managed_module_envelope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, loops 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fcd66bd92081544d2d5e70d871672c411e0c4ad8b9351de0da2e7c6e6e5eff"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.improveStack (cognitive 24): node_util.improveStack has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 8, 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":"crates/celld/js/node_util.js"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb38dca86e900d9b2ea8252271d1c87a52b7c9047487707b2eef20678371d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 24): fetch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4, boolean chains 3, error handling 2 (3 pts), other 2 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 4 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":"crates/celld/js/harness.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"552ef14a7673ead5dac3224a833d39e2c781be5dbcdb90828ce41a12b084fd6d"}},{"ruleId":"D2","level":"warning","message":{"text":"start (cognitive 24): start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (9 pts), boolean chains 1, error handling 1, other 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b43283e888ae60dcae42c149ff49a1ba689f39888bb2596246cf6c9789e5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 24): (anonymous) has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 4 (5 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2 (nesting depth added 4). None of this is in the body itself: all 24 points belong to 16 function items inside it that branch (exec, constructor, toInput, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/url_pattern.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a1744f8010b0333493cf78ebcbf8cc942f3464d7b464ef69ff531973816eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadNodeGc::run_pass (cognitive 23): DeadNodeGc::run_pass has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dead_node_gc.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e019bb4bb608776188c6b400e543b50eb5a56842a7fb6705dbf3ce005f3e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::assets::parse_redirect_rules (cognitive 23): celld::assets::parse_redirect_rules has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa24d918b273a9553d9f84a5a464f63032540316ddafab0a13b28e20078745c8"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::wait_for_shared_enrollment (cognitive 23): celld::control_plane::wait_for_shared_enrollment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8ba70ea29bbab3f26b2812dd8fd9a82022e1e15415e0a5b5817ec1a3c6ba5c"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::env_vars::validate (cognitive 23): celld::env_vars::validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/env_vars.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d7233d7cb2ee002b08fcb949fd041cdaab2deb006d61ac6f7d028ce109c1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::kv_blob::run (cognitive 23): celld::kv_blob::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_blob.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfce3338135c7edc444f360edcf8a623ce80d85787ad907f330776b80285843d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::owner_read (cognitive 23): State::owner_read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 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":"crates/logic/lib.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf5163bb613bc6ca1f00967da5d6264c644e279002cdfd9ddd4bdd53165fd50"}},{"ruleId":"D2","level":"warning","message":{"text":"SubtleCrypto.exportKey (cognitive 23): SubtleCrypto.exportKey has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31ce4d141d8efd2407a4611423150ccc3597cfb55e3993b75026ee2c49a45b"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__stubOp (cognitive 23): harness.__stubOp has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4626, 4647). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d34c1f48a11699142007eb0b1faf2f99461bbd2dede3c91250a6ea8df6e75f"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__wfStepConfig (cognitive 23): harness.__wfStepConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, 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":"crates/celld/js/harness.js"},"region":{"startLine":8162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1bd0ce4affa6fb8ee33ac74c8a3eb9979bf402c555b2c16eb7f2b0ba5b7ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"node_assert.matches (cognitive 23): node_assert.matches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1eb89864c340ce43398a1a3645c8e0fa8013f2e9c75ac5db11897ad345e03f"}},{"ruleId":"D2","level":"warning","message":{"text":"streams.ReadableStream.from (cognitive 23): streams.ReadableStream.from has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, error handling 2, ternaries 2 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e3fc67a18da282ec1d58b57eb98c233c555d2ecc80cc25c3392d4bf24e4c64"}},{"ruleId":"D2","level":"warning","message":{"text":"removeListener (cognitive 23): removeListener has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (2 pts), other 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8222769689fccaa2634ce154739baa31ed5d3e4fc9d026c005a1d30e521468b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generation::build (cognitive 22): Generation::build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/generation.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a80ce4be196d1da9d998d7a8754968814adebfb15fd9d7816b7fd2ab51306"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::maintain (cognitive 22): NodeLogManager::maintain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":5687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350eef3b20fb63814a61b9a997914bc9fecef44ffe14b311e5eb9525f95283e"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::collect_asset_files (cognitive 22): celld::deploy::collect_asset_files has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d12d2fe06196fa510a647275e6fff8d0b39e2216913f1a275850e7bbeffb1e5"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::begin_cell (cognitive 22): celld::js::begin_cell has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef40d6bd5f2f30e4cea447626bec759f64ca54e6aa654e6a6241dcc73fc15a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::op_loader_fetch (cognitive 22): celld::js::op_loader_fetch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 7 (9 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3d0b0d51bff96cb772d64d0acf1a0effbff4a6f65499379fdf5bf78a4b21f"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::ltx_repl::compact_cell (cognitive 22): celld::ltx_repl::compact_cell has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49d8256c490028c4ea56a677225430153ecac0803b81520168e531acaf83383"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::start_pointer_watcher (cognitive 22): celld::start_pointer_watcher has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"291658f50c1cd6ab55c09494e53a7beca330eccf08e016ad4f1b0b2d5016adfc"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__r2Range (cognitive 22): harness.__r2Range has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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":"crates/celld/js/harness.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"369acf3c1981a6204643a7c46180ecbe57dea22e239ee8a60e20d052f82559e2"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.formatSpecialArray (cognitive 22): node_util.formatSpecialArray has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6833bc9a742a31952f263f861b1b94fe3a64386922950101d3473d7d4993f62d"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 22): constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 6, boolean chains 4, other 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5600a166ea99ecfefeb87be6747722553f6aba8728b6073c4023afd9dbf92550"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeLoader.encodeLoaderEnv::project (cognitive 22): __makeLoader.encodeLoaderEnv::project has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, boolean chains 5, loops 3 (5 pts), ternaries 2 (3 pts), other 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e98c122aa0614f5165284bf92a66979a3885fe3a10dd1110655eb09270f27f"}},{"ruleId":"D2","level":"warning","message":{"text":"__storedLift::lift (cognitive 22): __storedLift::lift has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts), other 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c856497166c7a5ea844f19c751f3cb950ebdb23ea2647341044134fc7dbdfd"}},{"ruleId":"D2","level":"warning","message":{"text":"__fetcherHelper (cognitive 22): __fetcherHelper has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, other 2 (nesting depth added 9). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 5100, a function literal at line 5090, (anonymous)::start, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f82943bcee75fccafe02ba7acafc4b331f6c578cde376f8b3145290b9066f81"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_drive (cognitive 22): (anonymous)::_drive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"f536125ee13442778789a0f9134419b0688b9b453fabfac8956504b4648bc78e"}},{"ruleId":"D2","level":"warning","message":{"text":"styleText (cognitive 22): styleText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 6 (10 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1e3bb78ad678c10f32f88a72f2f262808afd0a2f9a335f2166240b4c2f7ada"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::fleet::diagnose_checks (cognitive 21): celld::fleet::diagnose_checks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ce8ddb022deec22b672d786c0086725cd3589eea67c88c222d1045303153d5"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::main::websocket::handle_websocket (cognitive 21): celld::main::websocket::handle_websocket has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 7 (8 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d3e100ffa7522604247c7c9642600a8438c40fff704e221ee70355e683fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::sql_ingest (cognitive 21): celld::storage::sql_ingest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c1571954e3494b2ad39fefc76036c99a31c35d74826f5ffd4efcd99f1e7b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::d1_run_statements (cognitive 21): celld::storage::d1_run_statements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97c04747b333ec3264630f6d65ba15528c157981a27df11bc5d1bd585cebb3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SubtleCrypto.sign (cognitive 21): SubtleCrypto.sign has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d66c3e87d113e8f765a549679778dd0d173cf4e20b7d516511ef5d60883323"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableObjectStorage.transaction (cognitive 21): DurableObjectStorage.transaction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 3 (5 pts), boolean chains 3 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830d66f0147a944233a23bec488a2b861e0783b8202045ad75aa9b0e3a43738"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__finishServiceFetch (cognitive 21): harness.__finishServiceFetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f673d113af87b15b54bd071dbda3c8332cc2d3c893e3101966215e67d9e07cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.getOwnNonIndexProperties (cognitive 21): node_util.getOwnNonIndexProperties has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d804035f33d2f0d594f13e4705d42023adb4d1db2c3c004fc1d1183ce3b73482"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeServiceBinding::fetch (cognitive 21): __makeServiceBinding::fetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 4 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0f0ef41b169169d9a117dc38eaab9b2c9b2858dca891d18f6c10e321eb4b68"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 21): constructor 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":"crates/celld/js/headers.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73a703243e03428c6b442d574a3b5c1913262e630503e04fc225a205b94e66d"}},{"ruleId":"D2","level":"warning","message":{"text":"__hrPump (cognitive 21): __hrPump has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (5 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 449, 456). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29b551c2a870807dc5f7e2725742c107409a31af33bccec35bca87f44f61ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"Bucket::open_with_sources (cognitive 20): Bucket::open_with_sources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff2368f1113774de5019c5e68d9a2bb3adb2e239600a250c37b425cc1d593e6"}},{"ruleId":"D2","level":"warning","message":{"text":"InFlight::answer_settled (cognitive 20): InFlight::answer_settled has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33f78b7042783c4d50dfd89dd65d2e63d9d4e9e13e33a9de500258936ed47fd"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalStore::list_paginated (cognitive 20): LocalStore::list_paginated has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/local_store.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"008842c812761fb6498e3e5f323e045a34ca18583478149f6a49a5fd39448fce"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkRuntime::flush (cognitive 20): SinkRuntime::flush has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c337e74451e4119852fc7a4678b4a9a35486c92f8207806ca4a1ab4fc3695766"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadableByteStreamController.enqueue (cognitive 20): ReadableByteStreamController.enqueue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9d96975daf0027a6ccd4b0cfa0ec0048513d39565d3759170523559e2f5be0"}},{"ruleId":"D2","level":"warning","message":{"text":"SubtleCrypto.verify (cognitive 20): SubtleCrypto.verify has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5c6da7ef7cff044f4b904a4d53f72137a83d1ba2eac6765c28ab2a2de59b9"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSource._connect (cognitive 20): EventSource._connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/event_source.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad54c9eb55cf698eb3a3de82c2667654dff795c70914eb73e4e3929738e8851d"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__wrapServiceResponse (cognitive 20): harness.__wrapServiceResponse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7480cb15d76c2ca0aa6a15db8cdd735f98c9d68310ee2e943c857a9c27f4b213"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::enqueue (cognitive 20): (anonymous)::enqueue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76672114c404889ca467683844a75e144c87c7041ceb5e1edebb999909a8a87"}},{"ruleId":"D2","level":"warning","message":{"text":"__entrypointOp (cognitive 20): __entrypointOp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). None of this is in the body itself: all 20 points belong to 5 function literals inside it that branch (lines 5698, 5702, 5692, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba1130a785b3c11e175f0ae13f26ac61e52ab2b4566f3c117b9be885d6bf8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"extname (cognitive 20): extname has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4790aa6f71562a4bb54574be3dcc079711e758ceb698a3a4b575d48a9f62cc74"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::parse (cognitive 19): Command::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/d1_cli.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8493d11b3d59b7a8bd2fd10e7dd2d6d712940c06e7a55ac3d52408d02693be83"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::parse (cognitive 19): Command::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/queue_cli.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bdd2474979291ff3e79cd32c96ebdd0ef2637d89e854c626c34488b5471679"}},{"ruleId":"D2","level":"warning","message":{"text":"StatelessRuntime::start (cognitive 19): StatelessRuntime::start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94449c0ddce0e7200d44ef9e6af7320e3fedaf38c2801cd931304b91e5a80d7"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::assets::cleanup_cache_files (cognitive 19): celld::assets::cleanup_cache_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251208e568e960c17dd704fbab36fea96d48e8cfc80b723a8b1326c98a62f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::collect_unbundled_wasm (cognitive 19): celld::deploy::collect_unbundled_wasm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a78745cb3f24ed8db834d73ef2b56441f6d7b9f6b8cf5d7bab26a4b82a0d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::http_streams::prepare_http_stream_tee (cognitive 19): celld::http_streams::prepare_http_stream_tee has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 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":"crates/celld/http_streams.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f696c203f838b358214674521952ae2d0ca297ce07de64a192236eefe887dba"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::crypto::key_from_jwk (cognitive 19): celld::js::crypto::key_from_jwk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f7045e29765231f30efdaaddcb00049eff969d48d1fb0bf12de68cf1278668"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::kv_cli::bulk_export (cognitive 19): celld::kv_cli::bulk_export has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"135191c3fedd3e4ddcba26565343a6f1cad472dc6cdbe6575faf08a30bef9210"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::node_log::http_append_job (cognitive 19): celld::node_log::http_append_job has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f275027e7dcce0483671363db7df7993234d42811b84813b5b5ee62549b9a6"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::recycle_sql_statement (cognitive 19): celld::storage::recycle_sql_statement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2625d73e1b39e976193a91842daa6c5e5dffd4091ab7065c5d99ef6c5bc886"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::telemetry::pump (cognitive 19): celld::telemetry::pump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bd3043451d9be176903da8010627730b1fdecac167b699c572a3251ae1748e"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket.send (cognitive 19): WebSocket.send has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10569}}}],"partialFingerprints":{"codehealthFindingId/v1":"114cfdf31c75f1d33d21bfd6dca54f1ce7c80a8c7b6bddce47872cee8d860aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__installLoaderEnv::revive (cognitive 19): harness.__celld.__installLoaderEnv::revive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7919cea6e137cd4d745972fae8b740b1420fc9c229a2d9fa2dd2072f788e60f8"}},{"ruleId":"D2","level":"warning","message":{"text":"node_events.EventEmitter.removeAllListeners (cognitive 19): node_events.EventEmitter.removeAllListeners has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a9954b1fc88b45a3a6a8783fa9f94bcdac878913b400922ed907db3e62a16"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.formatError (cognitive 19): node_util.formatError has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, loops 1 (3 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af26cdcdae54927dc02183c84a979c85e6e52a7e250a53db3eb35c54bc33c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"_blockConcurrencyWhile (cognitive 19): _blockConcurrencyWhile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (3 pts), error handling 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 2668, 2638, 2716, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"02def4014d5e687a172fbeed8953833e516b7de6531e68e2a6a33711ffe35a22"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeLoader.makeEntrypoint (cognitive 19): __makeLoader.makeEntrypoint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5, error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to 10 function items inside it that branch (fetch, a function literal at line 3266, get, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f14a6e2712363929d4b4d46e9e12e6c335dd62461ed38f5c958e8ef6b45d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"_settle (cognitive 19): _settle has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), other 3, ternaries 2, error handling 1, loops 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 7244, 7224, 7212, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":7197}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b30e66d9bf74804d4e44bf0b3a06ca007f29616e574ed7680f85ac17e12125"}},{"ruleId":"D2","level":"warning","message":{"text":"kvService::fetch (cognitive 19): kvService::fetch has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (6 pts), other 4, boolean chains 2, error handling 2, if/else 1 (2 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02e71a6b757a8df421538eae2c4bc036f8d1e10ae0d015203a7c6311213355b"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerEngine::networks (cognitive 18): ContainerEngine::networks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/container.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe929c351022ab01da6ae09346a5956c6220f7bd5f47b05848feb67e7acd78b"}},{"ruleId":"D2","level":"warning","message":{"text":"LtxRepl::close_in_place (cognitive 18): LtxRepl::close_in_place has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":3224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebf3f11ec66e14cbf5c578b85cf4200be936551e4b946d4f1484c392f26e5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::assets::requested_range (cognitive 18): celld::assets::requested_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfce2854eb6ba516cef0696b0e45eba8933ba99557f50b859dceb2517b7edbf"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::build (cognitive 18): celld::deploy::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f947b226666c510b774e032c24b465e69812a29c4c64a8c4c4a33f0f4938277"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::bootstrap::build_env (cognitive 18): celld::js::bootstrap::build_env has cognitive complexity 18 (threshold 15). Drivers by points: loops 10 (11 pts), match/switch 2 (5 pts), if/else 2 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/bootstrap.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd492d282178f6f75fbaa914d0e1e142d443b4b54c1d8842b3977de921388b9"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::modules::scan_external_imports (cognitive 18): celld::js::modules::scan_external_imports has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/modules.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18e7808c281a07db6fa266bac0960b3ef1265ac722f039c04def7f88553ba1b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::main::peer_tunnel::serve_do (cognitive 18): celld::main::peer_tunnel::serve_do has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/peer_tunnel.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b65c99930ed9cd4d6a5a7f5b7246349a7da064853f395c9c96d5249b433161"}},{"ruleId":"D2","level":"warning","message":{"text":"State::pump_release (cognitive 18): State::pump_release has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":5614}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b4ffbfd4f778f2adf334775f0400589e66ed8d664f38fb7b64a4e9dff89832"}},{"ruleId":"D2","level":"warning","message":{"text":"__WorkflowCell.alarm (cognitive 18): __WorkflowCell.alarm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9005}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0feb23b9d705af2ef1f9c7e6ac5c3b615d8f3376ebaf1245bbc20ada5b4f68"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__makeLoader.makeEntrypoint (cognitive 18): harness.__celld.__makeLoader.makeEntrypoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). Of this number, 9 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4e15638f7f223aa10fad0b26e2f3a62a27a514385c198e16c6753bd17eb763"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__makeLoader.encodeLoaderEnv::project (cognitive 18): harness.__celld.__makeLoader.encodeLoaderEnv::project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa7d773334e9000bb5fe2c44753b496b8686b14c4e15b31f9d5d07d9fd0f110"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__d1BindValue (cognitive 18): harness.__d1BindValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":7719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a769d98d6c318fa67b3e94fa733f682e48296b408c5e3cd5e00ba61d5ea19a49"}},{"ruleId":"D2","level":"warning","message":{"text":"node_assert.inspect (cognitive 18): node_assert.inspect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, ternaries 3 (5 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aa6de1e660d5ffbb29b3552b68742e3ef25f09092e465f8c884c6a617cbb47"}},{"ruleId":"D2","level":"warning","message":{"text":"__dispatchEntrypointQueue (cognitive 18): __dispatchEntrypointQueue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 4, error handling 2 (3 pts), match/switch 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 9 function items inside it that branch ((anonymous)::retry, retryDelay, (anonymous)::ack, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b25e53a286c0933828e47f9ab010ceaf85a7e8118b54ef760ea022a3e3c85e7"}},{"ruleId":"D2","level":"warning","message":{"text":"__hrService (cognitive 18): __hrService has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, error handling 3 (4 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b497ba84192f4741eae3d5302b13edfbcc594726a177f9ed4a7413a25126ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::transcode (cognitive 18): (anonymous)::transcode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaca91540296bd24d80ef934e30de6ae837b84f3ff2e75e37dbb6a282b37d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"extname (cognitive 18): extname has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490fe99d13e1245523894c44508b2b4a512dfd9e2a4edaa4c44a45466daf924"}},{"ruleId":"D2","level":"warning","message":{"text":"encode (cognitive 18): encode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/text_encoding.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9948a2bd0fd449f5749556dc534d85446a11d684680497df0a192b431dfcbb"}},{"ruleId":"D2","level":"warning","message":{"text":"LtxRepl::local_cells (cognitive 17): LtxRepl::local_cells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":3999}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f45edc7f110fc3f8cdadf4e4cf2a933e0c80d4361d7c83fc7cc072adfe213f"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::fold_cell (cognitive 17): NodeLogManager::fold_cell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (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":"crates/celld/node_log.rs"},"region":{"startLine":6894}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028a65c0f54bc2b42a1ea473ea182b642b069ba9220555b8d85007ff8a9b966"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::pass (cognitive 17): Collector::pass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (4 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/wake.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deb95be5d59dcbb71c61173dbb986accda6f09854316ff03e7c56217e75f25b"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::control_plane::start_deploy_agent (cognitive 17): celld::control_plane::start_deploy_agent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b631fe3ed882425221bdcfc035b76e1cbf055911b93e19f4544a71acdd6f67a"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::dev::start_node (cognitive 17): celld::dev::start_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dev.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"144ef45cade31d384e154633a151a7aa2791d0bc2fac8544662ad0c521306686"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::op_facet_fetch (cognitive 17): celld::js::op_facet_fetch has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 5 (6 pts) (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8444}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ef61392d141d6ff8a58e002ba07fc8ec630fd7c340587a441ecf8c08aa381f"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::r2_cli::run (cognitive 17): celld::r2_cli::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/r2_cli.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf12d36fea7148244c3a3136a9de654e8599bb75cb7e68aa1d72bd42bea787c"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::d1_row_value (cognitive 17): celld::storage::d1_row_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a722e5d3adfc75a37445f10f843aad2fcd50df64f5eb628a3011abc6e2144b71"}},{"ruleId":"D2","level":"warning","message":{"text":"State::pump_swap (cognitive 17): State::pump_swap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, match/switch 1 (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":"crates/logic/lib.rs"},"region":{"startLine":5296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff8729eeb755ce23654276179943ab309681e9e0ea18dba3f0b1906b9da05d2"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__walkLocal (cognitive 17): harness.__walkLocal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf5ffffbb051f2167d86b26f87f41dff4366aeb0c6567086623af3833a0464f"}},{"ruleId":"D2","level":"warning","message":{"text":"node_util.validateObject (cognitive 17): node_util.validateObject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab62abd0425a2b4b7a3e3ce0767f2520bc0fc7b3de18d2d63310272a842f616"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeR2Bucket::list (cognitive 17): __makeR2Bucket::list has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, ternaries 6, if/else 2 (3 pts), loops 1, other 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2560e36e5de0ad978ca29701948333a50d9fabc912ee6d08106de7404edd1a"}},{"ruleId":"D2","level":"warning","message":{"text":"__makeNode (cognitive 17): __makeNode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, error handling 2 (4 pts), boolean chains 2, other 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 10 function items inside it that branch (apply, get, a function literal at line 4749, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3308e9b4f9013cad867e49a3790aa8022c0311c203e0401e737dbae16d33cbda"}},{"ruleId":"D2","level":"warning","message":{"text":"structuredClone (cognitive 17): structuredClone has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3, ternaries 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":"crates/celld/js/harness.js"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6563b1d44d7a46f429c571ab18c1a1a3dbfb6911fbe3f3dfdf23979ff9df206"}},{"ruleId":"D2","level":"warning","message":{"text":"addListener_ (cognitive 17): addListener_ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (3 pts), boolean chains 1, other 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"181200b27279d47218a26ea45d3ae0feb8b311d30426aa87eab6bb3188e94dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"getFunctionBase (cognitive 17): getFunctionBase has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"639868b6d10e43bc4961d8285e34b8d4253151453665a6af31f6922929fcc028"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor::handle_message (cognitive 16): Actor::handle_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"158ce7f26b2e68c28028352e974720b9331331e8f1655e9c4ee66888a9b1781b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetResolver::apply_headers (cognitive 16): AssetResolver::apply_headers has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc641ff83db0a10ced3e61542bd71c65475030fb067bf97601913376f80e174a"}},{"ruleId":"D2","level":"warning","message":{"text":"Bucket::put_blob (cognitive 16): Bucket::put_blob has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 2 (6 pts), boolean chains 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":"crates/celld/bucket.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b481c009fa63df28ce0b00b0c589460142dcb64e745deb26c42defc4a509cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpStreamService::register (cognitive 16): HttpStreamService::register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6f5861838eb32294d8787f68e5ee86973ea0b74cdb161475aa49091e28ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"FollowerStore::followed_sessions (cognitive 16): FollowerStore::followed_sessions 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":"crates/celld/node_log.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57061223d00f76007b43be3a4ab0ff6065133c1deabac8ee53507dc45f84d15"}},{"ruleId":"D2","level":"warning","message":{"text":"FollowerStore::scan_committed_batches (cognitive 16): FollowerStore::scan_committed_batches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9fb70402d55ed43d9709349f6a657684423b166b13e181de114f1786dc736"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLogManager::upload_gathered (cognitive 16): NodeLogManager::upload_gathered has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (5 pts), match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":4762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f1e33aea61a403ddaa5ea1c51434f78ebcbc3229f7c3bdad416a4f703c6589"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::assets::compile_rule_component (cognitive 16): celld::assets::compile_rule_component has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f4b9f2dad0a61011fc42206f96dab25c3579f6f428a63d0d3b849c61ee203"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::cell_cli::parse_listing (cognitive 16): celld::cell_cli::parse_listing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/cell_cli.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1b4a670490ac00efa21d8b816d1656213e1014e9dbb619cd04f3ca59f2f797"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::deploy::python::collect_vendored (cognitive 16): celld::deploy::python::collect_vendored has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy/python.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5377571373a819d8a141be1fe61ee5ca75445313b83696d1278ae5c9883484"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::run_cpu_watchdog_service (cognitive 16): celld::js::run_cpu_watchdog_service has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef420acac6dfb1caba808c5a66d0fcc86885ce28df78073115e9bf7dec2f925"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::js::settle (cognitive 16): celld::js::settle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6294efd66a091e02f5504d2d3ceebe83fe267c132fa73238b9e4fd8e2587afe"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::spawn_shutdown_acceptor (cognitive 16): celld::spawn_shutdown_acceptor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2627de78e03dc8d44e007fc1470267557421bc5aecb368806b786e5bc0c54a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::storage::transaction_control (cognitive 16): celld::storage::transaction_control has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a74a0cf1dad3712a1452b1564838e9194a411722b2debeaa500838d70f1bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"celld::wake::run_cleanup (cognitive 16): celld::wake::run_cleanup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/wake.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cf4040736c5ae511c1ee565ea8067fea71e7e0679315ca9809a6c79f7f75fd"}},{"ruleId":"D2","level":"warning","message":{"text":"State::pump_activations (cognitive 16): State::pump_activations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (State::pump_capacity) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c929f644bc50100579c62786e321d4b217ef51f942a63e01d9ad2d0daea26c4"}},{"ruleId":"D2","level":"warning","message":{"text":"State::pump_capacity (cognitive 16): State::pump_capacity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (State::pump_activations) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fff318b2ae90b11122ed02d1cc085e2c77499aea7d353012b0729b35fc240e"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__iterableBody (cognitive 16): harness.__iterableBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"721aaa0aecf48c8deff2c5251067b15fb8a97e8f3457a21d163c8fdfe3fb98a2"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__bridgeResponseStream (cognitive 16): harness.__bridgeResponseStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), error handling 2, boolean chains 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 11386, 11392, 11389). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11384}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c3bfb0ff00778854842d4e4883bfabab880d51fe280b4f229175eaa55eafdb"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.__celld.__readResponse (cognitive 16): harness.__celld.__readResponse has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 3 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b484e7c3ff8cb8cb306f22e2e26e41e135675a7301b5a53ad2339d8f3c5a99a7"}},{"ruleId":"D2","level":"warning","message":{"text":"WritableStream.constructor (cognitive 16): WritableStream.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/writable_stream.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0b1bf716cb18b0495ce35af5817a66ecdd50972773674eb40c46d101c7ef80"}},{"ruleId":"D2","level":"warning","message":{"text":"__rpcSignalRefresh (cognitive 16): __rpcSignalRefresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4179}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5347044a868a71d3a255efa80e2f6cfb8dc7eec124d7190e65133a6410d846"}},{"ruleId":"D2","level":"warning","message":{"text":"addEventListener (cognitive 16): addEventListener has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9733}}}],"partialFingerprints":{"codehealthFindingId/v1":"805da70972fff60f9aad8edb64c12158f3ced5f58f8cbae373e7517e9f06c68b"}},{"ruleId":"D2","level":"warning","message":{"text":"parseAddress (cognitive 16): parseAddress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 1 (2 pts), boolean chains 1, other 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":"crates/celld/js/sockets.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e537933f33839730ec115d67e1a42fcc66df41e994c1a472dc1a93f5a082388"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 16): constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 3, boolean chains 2, other 2, ternaries 2 (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 10 function items inside it that branch (pull, write, a function literal at line 76, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/sockets.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1737d74c2d2502a813857b23ba8ad7bc656bbc958bc5726351c0d2c1e677d011"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/harness.js: FileTooLong \u2014 7863 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 7363 over it, 15.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a390cb591ab6eaba8842cbcb697cb38106e6bc68fee868b2fc95d967a98188c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/js.rs: FileTooLong \u2014 7708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 290 free functions. The bar is 500 significant lines; this is 7208 over it, 15.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74f0a3094c0581f25f20feff052e20fdaed78dd89ea4eba980a2dc1b8e358a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: State: ClassTooLong \u2014 3609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 161 methods, 2 blocks, lines 643-6688. The bar is 400 significant lines; this is 3209 over it, 9.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ca5eff067ddd1ace98ca48e212bfb0553cb0279eef538ed67da2a4b80d23c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logic/lib.rs: FileTooLong \u2014 4240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: State (2 blocks, 643-6688). The bar is 500 significant lines; this is 3740 over it, 8.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e24e95a390f67349cba8f4adc40c3daaab250c5060ab817ef4c869002eaff6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/node_log.rs: FileTooLong \u2014 4095 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 3595 over it, 8.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fde5ac24bb8ef7e41f6d78df35b5c1a33e04d5496b0b45b9d0e166aed672c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/main.rs: FileTooLong \u2014 3704 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 3204 over it, 7.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c525dd8b354c8a2559574219cac15d236d331c3839b4b3da654f3290ef18917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/ltx_repl.rs: FileTooLong \u2014 3212 significant lines (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 2712 over it, 6.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db2902a606f17ab1fd50c2c9d5cea42a7838fde9be845f4f7ea593e91f0f00c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/node_util.js: FileTooLong \u2014 3156 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 2656 over it, 6.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95786c1104d51ce554ff236ed9ff3fe1436924e7fdac63a4e3d425189c933f93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::crypto::crypto_operation: FunctionTooLong \u2014 celld::js::crypto::crypto_operation runs 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 519 over it, 6.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b5012438abfcb6fd5a63599ec8596d49e57e850f766ec78c56beb66bccc0ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: kv.kvService: FunctionTooLong \u2014 kvService runs 611 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 511 over it, 6.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66481460859323985b5ec054d031e546178b0f465bd520a9cc74d1890ce8eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/storage.rs: FileTooLong \u2014 2817 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 151 free functions. The bar is 500 significant lines; this is 2317 over it, 5.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"364c397396a9f275fd8c6804aa77e29372b5c64d1519b889331623ec04056236"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/actor.rs: FileTooLong \u2014 2741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2241 over it, 5.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f2108691d054849ce0a39405abb59d7c386e561dd40102d9b1207f694f1225"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 161 methods, declared across 2 files: logic/lib.rs (150), logic/output_gate.rs (11). The bar is 30 methods; this is 131 over it, 5.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dea0f4dca86c6246689176b9f569bef71cd3d80060355de5aba30d7f5e31d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/runtime.rs: FileTooLong \u2014 2287 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1787 over it, 4.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b59a5ae9781f887bbbaf4be18e5c34b598e9af503f0c0a945b323b8a115d245"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/deploy.rs: FileTooLong \u2014 2082 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 1582 over it, 4.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c95401f0a04b0f6af7cfab8ee909aa0ae4f0822cd03e3c4458a4f4287d075e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/control_plane.rs: FileTooLong \u2014 2076 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 69 free functions. The bar is 500 significant lines; this is 1576 over it, 4.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6095506898e2d051a24a2e587afac9fc976a9ec4abf86b37fac30cffff778c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/crypto.rs: FileTooLong \u2014 1357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 857 over it, 2.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619c1026d594ce4e43c39d7229d77223f2af00f674ae8605aebd16f0dcdc1de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.validate: MethodTooLong \u2014 validate runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4f590edc2dd4cb643645985ef565113108f294de234340a57f100d67c76a2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/http_streams.rs: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 740 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f93ca400c8706a2bba7264d04180e983a920e2e4403370e6d110a9905b0885"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/bucket.rs: FileTooLong \u2014 1176 significant 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 63% of them inside a single declaration: Bucket (2 blocks, 177-1798). The bar is 500 significant lines; this is 676 over it, 2.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9c33943db1824b2adeb513dbc9fbe0f650e0fe78944ad2034f61238b74bfe8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LtxRepl: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a38ca9e6fd44e4d860ac9b62e3707c88a9623595e91ca4e9853658b402366b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuntimeManager: ClassTooLong \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 3 blocks, lines 619-2066. The bar is 400 significant lines; this is 483 over it, 2.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2594af683540d76eb7de68812d8dd4526dac07d8319209b70a3a4cb7d330c69f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/assets.rs: FileTooLong \u2014 1035 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 535 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b00855f28f3199f28a49c6ba347c7fa4507760edf483d7eff803d2a5ec64bdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/container.rs: FileTooLong \u2014 1027 significant 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 64% of them inside a single declaration: ContainerEngine (2 blocks, 288-1362). The bar is 500 significant lines; this is 527 over it, 2.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed4bd77997d4aa42f347808f93fc7984e8c06e8a41284d2c2d230c4b1913ea3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Worker.load_config: MethodTooLong \u2014 load_config runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7a4add1253dde28c6dd6f382556296fd43cbb9c74502ea18965dbf8c3243cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::op_fetch: FunctionTooLong \u2014 celld::js::op_fetch runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8990}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe709bb1dbeefc98cec8c96e69c63d6e5b719732661d00f0c2362efdc3be6ada"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::op_loader_load: FunctionTooLong \u2014 celld::js::op_loader_load runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce19819f202efeb2327852f7732db59d7f31baef921ebf3b0544a16e0204e53"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bucket: ClassTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 177-1798. The bar is 400 significant lines; this is 337 over it, 1.84\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5325c1eee900dcc6cd04caa330d4ad16af355c76f35c7fb5853d73e4210f62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::runtime::drive_cell_inner: FunctionTooLong \u2014 celld::runtime::drive_cell_inner runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff97b77e4f0414ef801773d41eefbaeec70206e05d5dbaf99e9a9614d9be014"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::begin_cell: FunctionTooLong \u2014 celld::js::begin_cell runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f4458168e6c4081a0e718401cb150c24e35657c8948fad6251aafb1994afb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::kv_cli::run: FunctionTooLong \u2014 celld::kv_cli::run runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b5124f5d7b04246c52b28d52afc729c24beca45606c558b0be8694fdf7b450"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::queue_policy::run: FunctionTooLong \u2014 celld::queue_policy::run runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/queue_policy.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5429f27c411ee5c5e03132d90daa0d82699e9474333cdb4cb8b6025fb5de3c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld_logic::on_event: FunctionTooLong \u2014 celld_logic::on_event runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":6729}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970d4cdb94ff244938f82183bee1d57970a2d2aa69f9cf201f4a218cdfb8cce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: State: TooManyFields \u2014 53 stored fields beside 161 methods. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"29634bdbd31e1c3f91ab0bed8b0ef084da8b77b1386afa90212702564b91f5ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/telemetry.rs: FileTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 338 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bd0c12ec4f2e7c408b848918a2e1d7d75126c0b8ea92a693916ad0d8a006d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContainerEngine: ClassTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 288-1362. The bar is 400 significant lines; this is 256 over it, 1.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/container.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc73f82a2818dc37a798aae4267fe3ad3948b9faa7f8fb4663b3d0e11883ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IoContext: TooManyMethods \u2014 49 methods, declared across 2 files: celld/js.rs (42), js/input_gate_lifecycle.rs (7). The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":10913}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b144e533bd4e17658f286b1aca1d3d1c4b15519c4036c1ea2fd1e8a8242501c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/node_path.js: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 311 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dfcfc9f4d8922fb4a84a3bc80efc87d8fc1ec68588753cdc2ab544fe28b5a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/storage_ops.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec38ce6d6040c5f93778ec092431c0670f51732d023ad1dc3188e93750d1a2b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::control_plane::apply_deployment: FunctionTooLong \u2014 celld::control_plane::apply_deployment runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db496f8db69b0ea8dea190a0bb2de85c0fdde940b624a30f99458a4be14688"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: main/websocket.rs: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 303 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70349543b4b540c0d054069d1c2eab5795738d5fa15695a339cd732f0c4c01b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::fleet::load_worker_at_pointer: FunctionTooLong \u2014 celld::fleet::load_worker_at_pointer runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6585940041e3582ad609a9a146fc2413c19b9e1ec5815087f577d2775fc51282"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::main::cli::action_from_process: FunctionTooLong \u2014 celld::main::cli::action_from_process runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5b56a5960a4c9b5e33b0ca6e3bf4b74823e1753b3a668bb03d8223232a10e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.owner_read: MethodTooLong \u2014 owner_read runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7cfa2d4a5b5e153727976e8add4b33bb682a245739123d5fbbc6330e919261"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::storage::sql_cursor_start_values: FunctionTooLong \u2014 celld::storage::sql_cursor_start_values runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c13c0135d500c9af7bbd07b76a7d2d085defc2aa161e31d809e6a94ecbc95b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LtxRepl: TooManyFields \u2014 43 stored fields beside 70 methods. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd93d40d9c94a7feb3d8b9a7d2195e96babf216e4360da8fce228a24e0830b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/fleet.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c119efccf12f06eaf666fbd9f689a474ea19abd012dd3340eb528d640772a82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/bootstrap.rs: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2012a96c9a2680b036e21e6313ed9c3fb9594b2b56d274fe8990678c268e11ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::storage::d1_run: FunctionTooLong \u2014 celld::storage::d1_run runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace4f81ea2622d48480997d36acfce4fcd6749ec9a39fcadc6ee416a99ad9e44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Worker: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 5 blocks, lines 2190-6420. The bar is 400 significant lines; this is 143 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a37fa5006c426dea3d4468eaac93b6affd70e2bc6ac5f561897e5458ebc28ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/modules.rs: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/modules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a59353a20b114f88cb3f610f0ba249896c7017b56228233d72edc9b56fcd754"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bucket: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"da03ec55768691b2811d3d8034364a4037bce617d6f162ba73281532765cd1da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/ownership_store.rs: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ownership_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b33e84285df82685d2267764d26925b0df2d5d0974972d5c6085f8f8a2d664"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/ws_registry.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ws_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"604f4f6bcf82ece5dc3798b6e85ee623cfa9bd967bee634303f16dd53f2bceb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/node_buffer.js: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"659521361848b65822069edef7f80fb36153e97e0e02a2d1c40c0106a910b664"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::fleet::diagnose_checks: FunctionTooLong \u2014 celld::fleet::diagnose_checks runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dda00e9e9ce6a7b7b39a6976dc58ff79e74c3f5772aebf8cd3a8782d0c11f31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.parse: MethodTooLong \u2014 parse runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4f637529396a1cafe30396e7698de08542037f5204ab9cf4bc3b70c756d47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimeManager: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7446f0122befdb1a8006d1a8781bd5978054a9781e64b147d85fa1627ae0cb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::control_plane::wait_for_approval: FunctionTooLong \u2014 celld::control_plane::wait_for_approval runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b56a44dd06a439867d82e970c40a2c8ec75a3ca4bf367e10b6319f07daa4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/kv.js: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: kvService (34-1127). The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98801bb393c53609956d9ad5ff979bf21dec6c3906baa307814b8da8e8ec5e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::html_rewriter::run_rewriter: FunctionTooLong \u2014 celld::js::html_rewriter::run_rewriter runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"37050a3717ffcf519938dd4276d20b40a71ee8ad002c6dc23b8ffce20a481e26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/dev.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dev.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce195f9fdd805ee85b5f80d98d92753832eb97b75127aa22d3e765f5b10d66c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/streams.js: FileTooLong \u2014 606 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 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dab8c1578d07159ddf0f2d890d33ca0132be8516284548d33d490b9421b062"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::main::websocket::handle_websocket: FunctionTooLong \u2014 celld::main::websocket::handle_websocket runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"983ebde2c71d9f2dde148d77e3bbcb80b9124e4e77880a59853c349bcfa5b148"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssetResolver: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 31-762. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"315dc068fa0fc8182d49461a5c3d24fa260e86e5bd8229bee7a0d0a1e1e4fa5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InFlight: TooManyMethods \u2014 36 methods, declared across 2 files: celld/js.rs (35), js/input_gate_lifecycle.rs (1). The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":3268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d795206318f3ae805db25be9fc94272bc5fa8b3b03e6895b3eaac72b8e5d8063"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeLogManager: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c986e6308c31778dd6d389999de377496e4666f20e548d2df59eb0188da6283"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssetResolver.response: MethodTooLong \u2014 response runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"789a3cd5b0ec6e340df883e65c1cec9bd3e0dadedd461f966000658b4df01767"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContainerEngine.create_and_start: MethodTooLong \u2014 create_and_start runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/container.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc9e07c1a4cf2fb60190faee9aa6f573fcde15ae7cb88056bf876ca188985c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::d1_cli::run: FunctionTooLong \u2014 celld::d1_cli::run runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/d1_cli.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5baee9fc3d57b9b19a63fc0555573b41acef4c6d3589e7e21018f31839023"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::r2_cli::run: FunctionTooLong \u2014 celld::r2_cli::run runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/r2_cli.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a48b74f1825b83cb4a25978ca339432427e8cf2426d12914f36417dde30f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::control_plane::handle_explorer_request: FunctionTooLong \u2014 celld::control_plane::handle_explorer_request runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"398eb49d8e5aacdf01fb4f42b950416e0237483dd58020420ce2d479a3d01338"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::main::cli::print_help: FunctionTooLong \u2014 celld::main::cli::print_help runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/cli.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6f5c659694564e0e41622997af96f7556ae1bec0761bc7b79f748d1f24ae3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::main::websocket::outbound_websocket_task: FunctionTooLong \u2014 celld::main::websocket::outbound_websocket_task runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f058f680fb430fbbdb6ecfe99e6503bd87254c779a6f9a517032eac70d5fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::op_loader_fetch: FunctionTooLong \u2014 celld::js::op_loader_fetch runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1da3afd74957682785295a5baa270df7b4e4d66a88f24a3635f580899bc5238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logic/types.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f67936c88857afe3db73d27259fec42fbc6ca25c99005e568c608e3b3a9f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Actor: TooManyFields \u2014 34 stored fields beside 21 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7d46a8add0c818ced595b04a2f44321a149b3e6d328c4a2fd780d246dbb53b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.parse: MethodTooLong \u2014 parse runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/r2_cli.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18b469cb3d80cdbb43631de4ffc4244b4e7109a289e65ffa093b8de0ecd550f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: celld/kv_cli.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615e1aa04316e9c20bebc1166d5d33448c3f30cf4f949260b9467ec057dbce0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/crypto.js: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b006f59265761b0b2099b6404ae29d13c2725a064d85c8c3b8a009af2601de1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::begin: FunctionTooLong \u2014 celld::js::begin runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b32e478d2df2ad2031451f2ea72b51bf07c9f6e86430507b396544714c42095"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::runtime::wake: FunctionTooLong \u2014 celld::runtime::wake runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1862a384698323338f4c463ff6d534f23be0c25f0fe53a53e4d3199983275370"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generation.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/generation.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac67c90e6f4868fe08584b09c28df293830327eb5143268ad025bd00de44c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/websocket.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb559bc14c33d30aeed94e9fb62b9aeb7e23d1fe3d97a5e6a66ac2c722c588c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bucket.open_with_sources: MethodTooLong \u2014 open_with_sources runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee449fd2987497c5455ffa627e6b162e1c073b7ff24ea3964cf51bc8ee1b325"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeLogManager: TooManyFields \u2014 31 stored fields beside 36 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f2968cc311995ceebf7672d80694588d27f75753d035083dddf897b3b84280"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: celld::asyncrt: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/asyncrt.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdbc3ee79b11ec47dfac0605eca1c49083bfbae679300786c86aff781c9f8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::js::start_cell_event: FunctionTooLong \u2014 celld::js::start_cell_event runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5076}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c11affe414cb83414022a5a607bf344f98e797bdfd5feff65139c4ad110ad9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::control_plane::connect_at_path: FunctionTooLong \u2014 celld::control_plane::connect_at_path runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"43448049cf74489c82e5ad1165dcaab326e6c7a82014ea1bc700f07dfccf6eed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/byte_streams.js: FileTooLong \u2014 506 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 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68771fe5a9791931bacc14952d720f1a541b7005cdea1e52f66baf351c29a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: celld::main::peer_tunnel::serve_do: FunctionTooLong \u2014 celld::main::peer_tunnel::serve_do runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/peer_tunnel.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036465ad0c72c201d13cb692e6bbcfcafe0955948241f52ea9161dc44667225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/celld/js/storage_ops.rs:74-103 | crates/celld/js/storage_ops.rs:175-202 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5d37e581feac723c3e39db62a79282b5c7b19ce57c39495bcf385e150dc90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/celld/js.rs:4180-4242 | crates/celld/js.rs:4262-4288 | crates/celld/js.rs:4312-4323 | crates/celld/js.rs:4332-4359 | crates/celld/js.rs:6277-6324 | crates/celld/js.rs:6333-6352 | crates/celld/js.rs:6357-6395 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4180}}}],"partialFingerprints":{"codehealthFindingId/v1":"92493a6390b19802a8ee27c55a553c6972cd9f540d063ef0d51ac69a1ae4ed7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): crates/celld/js.rs:7134-7233 | crates/celld/js.rs:8711-8797 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9c4f1584ba77c317211f30093102fd0cc1d786d7348b5288fe1acc8cb1a6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): crates/celld/js/websocket.rs:348-440 | crates/celld/js/websocket.rs:474-547 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d065f78e3dadb64c96785c2062efb700e517fc7a8661c6bad83cfca4f324b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/celld/js.rs:11180-11209 | crates/celld/js.rs:11211-11253 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":11180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bae293a2808c44611f66d159ff94ebaf9c60e31001aac5744124362fc63087"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/celld/js.rs:12100-12127 | crates/celld/js/storage_ops.rs:711-746 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":12100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d536a202c64f9eb6514b3629a55f43147ffc88ccd86c2da6bff1101550c648e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/logic/lib.rs:2035-2076 | crates/logic/lib.rs:2297-2328 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"236ee35b9c36caddcae1fe175bf0ed306254385368f030a90465612c5833dc24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/celld/js/html_rewriter.rs:419-458 | crates/celld/js/html_rewriter.rs:465-499 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f8f62edc7367456c09cb5046dec42b214c554423744f6b053e4aa24272602c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/celld/deploy/python.rs:351-384 | crates/celld/deploy/python.rs:434-473 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy/python.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ae0a412414ebdfa2a4fd66ceb221b88ea17353343db6bdad796d2887caf608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/celld/js/tcp.rs:220-243 | crates/celld/js/tcp.rs:249-265 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/tcp.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"600337ad4524d1716bc48e9f5382f5244033ddd4f109f9ca509d3d6e94e22960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/celld/js/r2_ops.rs:198-224 | crates/celld/js/r2_ops.rs:373-397 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/r2_ops.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac6763437921a81179f71af78ad07a0da504bf40ccc0406a7e1b78e2bd992d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/celld/storage.rs:3541-3569 | crates/celld/storage.rs:3606-3635 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb23c238126207031c4b9a302494f6b7ed880f8b0ac8d4c87c07b27e04ec69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/celld/js/container.rs:81-112 | crates/celld/js/container.rs:201-228 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/container.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fea6b9fd4b15f37ef387885a41a0e2e510eac1401551be93780ae9bf72a0194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/celld/actor.rs:320-358 | crates/celld/actor.rs:360-395 \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":"crates/celld/actor.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2386f2c3fb47850bdc861355f3eead45f6f81728f6200aaa9da2c75de2b154f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/celld/js/storage_ops.rs:793-825 | crates/celld/js/storage_ops.rs:831-854 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6e4045fb41fb0b8f6861f48deb196a57e36f98fb2601df278b0328089bdb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/celld/js/crypto.rs:1555-1575 | crates/celld/js/crypto.rs:1764-1787 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd8bd9417b0f8192b3b6e9271ac30612a0fce8996625a29e50d09560effe2f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/celld/bucket.rs:922-940 | crates/celld/bucket.rs:943-958 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ce67d4ef4d2df90fb43f5459abd9cf8094977efdef5a0497e53629632c1133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/celld/js/crypto.rs:1699-1717 | crates/celld/js/crypto.rs:1724-1743 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a79c51ba98ce23a68b7f9a207c0644b160b9c262e7c973c75eb99fbd43c4ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/celld/js/bootstrap.rs:452-474 | crates/celld/js/bootstrap.rs:482-494 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/bootstrap.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d2f1e2a521ab6301b161eec48f926fc17e0daf7636274827fa41ce14f1d88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/celld/telemetry.rs:1068-1079 | crates/logic/wake.rs:179-189 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d29cd45a63332728bc512606d9b523edbf659aa3490a4fa266144c6d2cd1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/celld/bucket.rs:977-999 | crates/celld/bucket.rs:1297-1311 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fce4c830fab53e2f19358c0271a5b3d61cc06474734a69d7bf2ea344bc51c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/celld/otlp.rs:166-178 | crates/celld/otlp.rs:201-213 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/otlp.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8453dbbaf3fc82f31b1d911ebc51eaf8a768b66cf4dce66004ee05170561970"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/celld/node_log.rs:865-877 | crates/celld/node_log.rs:911-923 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8e4acb1274b3c54127cc4aa5b531fe0f10e5c8c136fbcbc5c80ea5b14780a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/celld/storage.rs:3463-3483 | crates/celld/storage.rs:3986-4003 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b40e7e964776b2790e07588ac3bf258cb677ce7449c1ca968a1e79355d343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/celld/host_services.rs:43-54 | crates/celld/host_services.rs:57-68 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/host_services.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cee6bc3aae18bd1aaf6a163be3dc012df0e6d980a94266ff46f96f4d8f4de7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/celld/js.rs:6137-6149 | crates/celld/js.rs:6259-6267 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":6137}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d21bed2b97ab8a668e317aeb25b0b27288592a37c8cacbaba1363ffcda000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/celld/ltx_repl.rs:2989-3008 | crates/celld/ltx_repl.rs:3020-3035 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"048961acbb751ee3af0bd14c81ed94a802e90168659447441ef0511d2b6c031d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/celld/js.rs:12353-12365 | crates/celld/js/zlib.rs:195-202 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":12353}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c8f3d7a116dc54bc4e51312d60c88c575128f80715f61b2f828bb696f92cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/celld/js.rs:2803-2814 | crates/celld/js/bootstrap.rs:339-350 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bfcab804a12a3c2357606669938add3d0787ec2faaa7d78c0c5fde9e31f5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/celld/runtime.rs:3062-3087 | crates/celld/runtime.rs:3177-3204 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a61209b69d6dbe20acf0158c98c539c56e1e2d703a590057d8d3def754193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/celld/ws_registry.rs:1132-1145 | crates/celld/ws_registry.rs:1163-1179 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ws_registry.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0cdb67ce6df1be6f4b33a950825dfa18ddf2412c8a4ae72627925f6db794d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/celld/js/storage_ops.rs:60-69 | crates/celld/js/storage_ops.rs:113-123 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9fb90cbd8df260814c5411570c1b77b5680a70f9b0b88d928f9f830135a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/celld/js/storage_ops.rs:751-758 | crates/celld/js/storage_ops.rs:763-776 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37a3eeac11aa8bfb6db3c64c91d69d699ca595610a2d7a2bcd50d1502a9b5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/celld/bucket.rs:1812-1826 | crates/celld/bucket.rs:2132-2150 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"560602f673c1f922f03ee7bbc85cb8bad2b92cacecc78d078f36936ce3aeca89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/celld/js/container.rs:140-151 | crates/celld/js/container.rs:157-169 | crates/celld/js/container.rs:175-184 \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":"crates/celld/js/container.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b46c516725eb1fcb11a71b19dba88e5d22cd232771bed9f82574833c12a61e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/celld/runtime.rs:1809-1827 | crates/celld/runtime.rs:1950-1970 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4bcb87f56ebd17cfbf2c78c9692422657816cc04c31f6b8a77a4004f3be2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/celld/dead_node_gc.rs:413-420 | crates/celld/ownership_store.rs:1233-1240 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dead_node_gc.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e614f2b1a037a67581fabae2ebe4d4f93f5d28bcf295c79239136fab9c92f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/logic/lib.rs:6976-6991 | crates/logic/lib.rs:6998-7010 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":6976}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b4026aaf9169395cddb4b46aeff730e9da86418eeb25b403b26e02a0d17e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/celld/control_plane.rs:1472-1480 | crates/celld/peer_auth.rs:360-368 | crates/celld/peer_probe.rs:211-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d8a4eae72a81adb08c0cf3a8a1e0408726fc637ed61383b1b19150e609184f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/celld/js/container.rs:289-299 | crates/celld/js/container.rs:305-316 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/container.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e63326cf561468fd351d10f7b9078ff002ca61b7ac106ba54446e0ffb738a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/celld/js/storage_ops.rs:131-139 | crates/celld/js/storage_ops.rs:162-169 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dc06a09b86d9a374e449f0a043bff65977faeaa17b84f28c5d816f337ca209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/celld/js/websocket.rs:248-256 | crates/celld/js/websocket.rs:274-283 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aa116ade92868f3b7ccc8321d3b7814c14dd352358bffc46b150123418f79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/celld/actor.rs:272-280 | crates/celld/actor.rs:305-313 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1daf8fabda6fd7a82f35e5399f3207b6bf329f6f1f9326c972bfce6ba0bc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/celld/storage.rs:3451-3461 | crates/celld/storage.rs:3660-3670 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d3a202f9fd8859734d0d4eecfd2131024e67a65c36d5c2ac85add013a0e7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/celld/js.rs:2775-2782 | crates/celld/js.rs:12540-12548 | crates/celld/js.rs:12550-12557 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"52eab0d4554b55127f313f5a3d362688a0a13fc339f88cefe7f4e91104eb36f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/celld/js.rs:8678-8688 | crates/celld/js.rs:9794-9799 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5352c3f11a7c46da9865242e4b9dc520807b2cad25b8e71f8e52aa87e9edd007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/celld/js.rs:12168-12174 | crates/celld/js/storage_ops.rs:631-637 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":12168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4666e19d62c6abc9a52bfcb4039eae178d50b51656da1dad34abdac1cc034f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/celld/runtime.rs:1836-1848 | crates/celld/runtime.rs:1884-1897 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"823e08e4fe9552ad5b81fdb392898a396e3777ef5027b471dd8b50a4e7c3faa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/celld/actor.rs:932-939 | crates/celld/actor.rs:945-951 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb991bfd7d8f0be03751a1db0251c456926175643a1ebac7c28d0e80ea7187b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/celld/dev.rs:512-518 | crates/ltx/src/client/file.rs:181-187 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dev.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"9549c449c58e76e13f1addba5dd8d1063b3837912a64a7a44cca7205cb2b9ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/celld/runtime.rs:3212-3229 | crates/celld/runtime.rs:3238-3255 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3194f529e79f7ca9035ea82a79761047747fe7d116a572b7d3aee237beb6c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/celld/storage.rs:3427-3435 | crates/celld/storage.rs:4133-4145 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f570229fd7d5b4b82e7d5ccbd44527fe91b15f3e7668af6508260ca7a55352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/celld/cell_host.rs:31-41 | crates/celld/cell_host.rs:70-82 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/cell_host.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"def845df8fd67f9ce244ef699fa8fdef53984abf868cefa5e713773869bb908b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/celld/machine.rs:48-56 | crates/celld/control_plane.rs:2639-2647 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/machine.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b877d62da6c5d73dbb06d8b1b07588664184c12d5cc80e5cc4eae9fcdb3889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/celld/js.rs:9932-9937 | crates/celld/js/r2_ops.rs:165-170 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9932}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb055c58a58ebb172a75e3071a17ab6c8be32d4500d1fe9d4156a98866bbb8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/celld/host_services.rs:245-251 | crates/celld/memory.rs:133-136 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/host_services.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecd1bd6c80560a8bacb6dc24aaec23066a47cc71d286eba98851f0d84a827e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/celld/js.rs:12179-12184 | crates/celld/js/storage_ops.rs:701-706 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":12179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1be5aebb73f72b6df88950bc3532a49284652be482dfbc1bdf37dde238e58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/celld/deploy.rs:232-252 | crates/celld/kv_cli.rs:807-855 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7c7e6e0e5e5199058fd82be1baac7391505cd209c0da3c78ed229c02e094f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/celld/js/websocket.rs:349-374 | crates/celld/js/websocket.rs:475-500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5fcc982b3212ab561391c6e50ec773f238addae30425bad88105cf04909a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/celld/js/storage_ops.rs:75-99 | crates/celld/js/storage_ops.rs:176-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbb64e8c12629d6288174aa692e67c10e0f2dec07a894ed8741075118351fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201337 lines \u00D7 2): crates/celld/telemetry.rs:1148-1184 | crates/celld/telemetry.rs:1223-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bb2b966a0ac00c4615f5c5f4aab8bd5394279c3f8eb0a440a0b72589e7a4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/celld/runtime.rs:3066-3087 | crates/celld/runtime.rs:3182-3204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/runtime.rs:3066\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060report\u0060 to \u0060\u0026Option\u003CAlarmReporter\u003E\u0060 in one and \u0060Option\u003CAlarmReporter\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"a725c41de5f71eda0a49e5b298379feaba1af88a0a4537fe049d16ca7cc1a88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): crates/celld/kv_cli.rs:186-205 | crates/celld/kv_cli.rs:305-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/kv_cli.rs:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/kv_cli.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14ddc15b47d5661ef673c9d980789dcb200ff0e346d8ad69ad8b6ed37f42663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/celld/js.rs:4723-4741 | crates/celld/js.rs:4962-4980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:4723\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4723}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f5331a7a42debbfaefeaa741b026ddd184b8290b186b896c5424fcb1ab3881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/celld/ltx_repl.rs:5067-5085 | crates/celld/ltx_repl.rs:5168-5186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/ltx_repl.rs:5067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":5067}}}],"partialFingerprints":{"codehealthFindingId/v1":"57111dc3c71e6fe7b2bc106bbbe2506897fec0482fb7664aa26bd4940a0a3914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/celld/js/r2_ops.rs:199-215 | crates/celld/js/r2_ops.rs:374-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/r2_ops.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/r2_ops.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2915f33fa00cd4e2e68e326830cadd64e9f47e635ee8fb4d5053c0fabf56181f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/celld/main.rs:3594-3610 | crates/celld/main.rs:3709-3726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:3594\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":"crates/celld/main.rs"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f391d8076d498db4e4abc810ffd97cac13c2015bcb97cdf2e0efb485b9871899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/celld/js/html_rewriter.rs:436-452 | crates/celld/js/html_rewriter.rs:477-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"072d1a29d81933b8c7cc47c4c4705a6aa71286e98d323c7c6eb4531bee18404e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): crates/logic/lib.rs:3345-3361 | crates/logic/lib.rs:3363-3374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"925831efe75975318da244d593606531e437251fc190e0f9f181bca94a828857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/celld/http_streams.rs:786-801 | crates/celld/http_streams.rs:1059-1074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/http_streams.rs:786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"552a000a44712f4aebb159c3027a73e0ce4cba85021c39ee387e22184f1ef6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/celld/js.rs:7186-7200 | crates/celld/js.rs:7768-7782 | crates/celld/js.rs:9064-9078 | crates/celld/js.rs:9150-9164 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/js.rs:9079\u0060 calls \u0060channel\u0060 and \u0060crates/celld/js.rs:7201\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7186}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d672563e5538fbcb37c356a1518dcf142c6b773d83429dc16f78f5bcb178a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/celld/http_streams.rs:683-697 | crates/celld/http_streams.rs:787-801 | crates/celld/http_streams.rs:1060-1074 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/http_streams.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e61e1c0529885aea2b4f3b60054301966745f6f98fa088ed38c1017d5a7c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/celld/js.rs:8393-8407 | crates/celld/js.rs:8497-8511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:8393\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, \u0060crates/celld/js.rs:8496\u0060 calls \u0060http_stream_service\u0060 and \u0060crates/celld/js.rs:8392\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b40e33693bd256fd32a5e75bdbd0e0d120a7cb8460831c07e60a86391e6b299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/celld/js/websocket.rs:392-406 | crates/celld/js/websocket.rs:513-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/websocket.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18c56f55aa28200afe4d761f0f77d94c7c8d58001ad5eb29b2d267eb5e80e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/celld/fleet.rs:525-538 | crates/celld/ownership_store.rs:708-721 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/fleet.rs:525\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1112d85da2ce11e9dbf7bdb4d98ce0cdde62ce749e94be3d403253ec0024ff4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/celld/http_streams.rs:1134-1147 | crates/celld/http_streams.rs:1163-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/http_streams.rs:1134\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, \u0060crates/celld/http_streams.rs:1133\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060mono_ms\u0060 and \u0060crates/celld/http_streams.rs:1162\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/http_streams.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"460152aa76a5b2359ec747c9580dffeabba129d11e34bdeccf1ef6e2ae9fac30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): crates/celld/js.rs:7721-7734 | crates/celld/js.rs:7887-7894 \u2014 both copies are in the same file, so extract the block 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":"crates/celld/js.rs"},"region":{"startLine":7721}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d52ee10196ed20902a6148b09550f006dffa886f942f9e161c299f2047f1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/celld/js/crypto.rs:836-849 | crates/celld/js/crypto.rs:900-913 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7d44487f940579b8fb85ab5928a11fcd98efa1328ff8bc7cd500cbf7879e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/celld/main.rs:2198-2208 | crates/celld/main/peer_tunnel.rs:94-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:2198\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":"crates/celld/main.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a7183237113ce73d56654fa6f35b3d1fdbd4fa570786a528da1e0f3cef77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/celld/main.rs:2188-2199 | crates/celld/main.rs:2559-2570 | crates/celld/main.rs:2613-2624 | crates/celld/main.rs:2721-2732 \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 \u0060crates/celld/main.rs:2188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"709312e6551f6e29e32315540988c8ce523022c5e136a807819066e34043f500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/celld/js.rs:8381-8392 | crates/celld/js.rs:8484-8495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/js.rs:8496\u0060 calls \u0060http_stream_service\u0060 and \u0060crates/celld/js.rs:8393\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b167d91e4ad499765bf3e3841bb82d23fe9830ad1f29aebf21ac9afa980ba75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/celld/js/crypto.rs:852-863 | crates/celld/js/crypto.rs:916-927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:852\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c1e09138ae9bc3da4d54bc44d31368aabb771c405a65a74ae9cad181112bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/celld/ws_registry.rs:346-357 | crates/celld/ws_registry.rs:379-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/ws_registry.rs:346\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, \u0060crates/celld/ws_registry.rs:378\u0060 calls \u0060close\u0060 and \u0060crates/celld/ws_registry.rs:345\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ws_registry.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada85c66f3e9ae66a94989c0acc9812c98cc1827beafc868c8b9d0f2db65af69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/logic/lib.rs:4116-4127 | crates/logic/lib.rs:4542-4553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/logic/lib.rs:4116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":4116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043a69509e7c206ceba385418df6f9dc533fbb5630ece48c36effd6b2788643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/celld/js.rs:7157-7167 | crates/celld/js.rs:7747-7757 | crates/celld/js.rs:8728-8738 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7157}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6f4d84a8bb95208ec1f232ed47b9ad3b5da6830a99201cf6975981d1358253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/celld/js.rs:4633-4640 | crates/celld/js.rs:5150-5160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:4633\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7292d4083009c2f314ffac777c41c4fa95960615af55e1473e37f7d4b5a56092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/js.rs:4703-4713 | crates/celld/js.rs:4942-4952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:4703\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, \u0060crates/celld/js.rs:4702\u0060 calls \u0060now\u0060 and \u0060crates/celld/js.rs:4941\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9936d4a285d1e26145e7a791c976cd35c018fe8b62d177132d12a9c61e2af77a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/js.rs:7222-7232 | crates/celld/js.rs:9101-9111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7222}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d56901b4a5755674848ef0bc0fbb6cef7b20bd240479f41592b9faa38c9e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/js/crypto.rs:751-761 | crates/celld/js/crypto.rs:888-898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:751\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9df960faddb07d6674df112569444cbc3ecda2039e06763dd23de3d6cc6f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/celld/js/storage_ops.rs:43-52 | crates/celld/js/storage_ops.rs:812-822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/storage_ops.rs:812\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fdf51bc8393b61e92f9c120e8931c76f9d7a38c56e04c8920b8c6cd8d5a731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/main.rs:3856-3866 | crates/celld/main.rs:4011-4021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"81568f8919c226afa30704db297219059c65bf5308bc58ee06dae05f007f9903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/main/peer_tunnel.rs:161-171 | crates/celld/main/peer_tunnel.rs:550-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main/peer_tunnel.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/peer_tunnel.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a0df27d55526a6936f45fab5039e7310520f0e27754f4e0f703a7abdadb781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/celld/node_log.rs:1465-1474 | crates/celld/node_log.rs:1481-1491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/node_log.rs:1465\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811906d720bfffab2ae17c27ee36bfe93ca3eda1a9513b464061ed3278e434d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/storage.rs:1497-1507 | crates/celld/storage.rs:1931-1941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/storage.rs:1497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/storage.rs:1942\u0060 calls \u0060total_changes_for_handle\u0060 and \u0060crates/celld/storage.rs:1508\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"730b6bf6d48567493f0d9bcb09e2398c88d4e19b79424101e5e30851df84dc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/logic/lib.rs:4092-4102 | crates/logic/lib.rs:4651-4661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/logic/lib.rs:4092\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":4092}}}],"partialFingerprints":{"codehealthFindingId/v1":"68677df971b389cc99395e32538ca2a9dda99c4a0c5cdf18c9cd29a86b173f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/celld/js/html_rewriter.rs:205-214 | crates/celld/js/html_rewriter.rs:442-451 | crates/celld/js/html_rewriter.rs:483-492 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/html_rewriter.rs:205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe76a5a8b5b7bb3eabefe0166320f7e5ab983b729d2066b66ce056ca7282ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/deploy.rs:2588-2597 | crates/celld/protocol.rs:302-311 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da44a2befa61fa54ae3c69424d00da32ce64376526c97f64e4af94857be9954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/js.rs:4270-4279 | crates/celld/js.rs:4340-4349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:4270\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060entry\u0060 to \u0060\u0026mut InFlight\u0060 in one and \u0060\u0026InFlight\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e522da7360cfe81934312b147a0b8027bfd8f2a18b1542ab46ade263385f88d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/js.rs:7210-7220 | crates/celld/js.rs:9089-9099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7210\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, \u0060crates/celld/js.rs:9088\u0060 calls \u0060unwrap_or_else\u0060, \u0060Bytes\u0060, \u0060into\u0060 and \u0060crates/celld/js.rs:7209\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a90356a90113fc842a2feebb3ea089b0631f52c5bc912a9cefcab7565304076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/js.rs:8370-8379 | crates/celld/js.rs:8452-8461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":8370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d22d3c29f9ba8902ccdacbccac4bf4487d0036686a31bb39344f340c3a331ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/ltx_repl.rs:2990-2999 | crates/celld/ltx_repl.rs:3021-3030 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/ltx_repl.rs:3001\u0060 calls \u0060record_durability_ticket_for_world\u0060 and \u0060crates/celld/ltx_repl.rs:3031\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cefee79140567ea82e96194657d7dab0293b65446cfd7e94f1f54ce8c69eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/celld/storage.rs:1643-1650 | crates/celld/storage.rs:2424-2433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/storage.rs:1643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9acd65cc3392eaffbdb6030a8a840092e41f3f3ba65c4fa1b7837902f1e19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/celld/assets.rs:1354-1360 | crates/celld/deploy.rs:2588-2596 | crates/celld/protocol.rs:302-310 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"211146bc769bf8c768c117ed925b27953b511a06deff8eadcb8081e8a58dc8be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): crates/celld/main.rs:4877-4885 | crates/celld/main.rs:5139-5144 | crates/celld/main.rs:5353-5358 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:4877\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4877}}}],"partialFingerprints":{"codehealthFindingId/v1":"108adc42eb6c54e0582fd9cd1ff2b00dd1e3afa356fc60f49e78c998f376a9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/js.rs:4181-4189 | crates/celld/js.rs:6278-6286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1973767aa5242d485a317ba185fd89761126caa9c97049862ec61ea57212e933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/js.rs:4395-4403 | crates/celld/js.rs:4417-4425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4395}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d00395e976c2ef319f154d01895eae1342cabed38ebd61f9ee57f137c22202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/celld/js.rs:9299-9305 | crates/celld/js/websocket.rs:374-382 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:9299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9299}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd1703c9b90104fff453bc0b5bdeb8dabbb9aea5a6906de6327ec283f9999a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/js/crypto.rs:1726-1734 | crates/celld/js/crypto.rs:1767-1775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edcf5e6cd134ad344df2538f9f951c496ee9024ae61ed6ef41dff5da12c9f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/storage.rs:3453-3461 | crates/celld/storage.rs:3662-3670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/storage.rs:3453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceed1a1befe2b0c95e4aa80db233ef22400c123de5ca243a34f206ce251ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/telemetry.rs:1137-1145 | crates/celld/telemetry.rs:1212-1220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/telemetry.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a57e428f788fb9e93841de51ec187ada9f448849f14e9b7135e2ca39481010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js.rs:1771-1778 | crates/celld/js.rs:5890-5897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a168367c4ea14377af411b01b766c130a16e347e29f9022e1f5c39a58997cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/crypto.rs:737-744 | crates/celld/js/crypto.rs:878-885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:737\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2731d3ef4e9ddd4856ad9eabcaf294c605ac54e0bee26278147de0bc39518c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/crypto.rs:1556-1563 | crates/celld/js/crypto.rs:1765-1772 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/celld/js/crypto.rs:1773\u0060 calls \u0060Some\u0060, \u0060view_bytes\u0060, \u0060get\u0060 and \u0060crates/celld/js/crypto.rs:1564\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f2abfc871980a494c0b0b74eaf6ac3e56a52be49db3ef59fab2ec9b8d67e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/modules.rs:625-635 | crates/celld/js/modules.rs:829-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/modules.rs:625\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/modules.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89786e9dfc4fdc773445012a2aaa2576da124833a2e4bc9dfd67c2ba5e9d21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/main.rs:3561-3568 | crates/celld/main.rs:3656-3663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3561}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6bda85f1ff77d91b3305ce57056c2e58caaacd189ae01b7ab03f0e27ae10ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/celld/js.rs:4263-4270 | crates/celld/js.rs:4333-4340 | crates/celld/js.rs:6334-6341 | crates/celld/js.rs:6358-6365 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn turn_cancel_pending_events(\u0026mut\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/js.rs:4274\u0060 calls \u0060advance_io_time\u0060 and \u0060crates/celld/js.rs:6345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21247f5bd7ceafc6488ad4138c1079f34ab5ac2a30dfc07496215da629bfcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/celld/js.rs:4275-4281 | crates/celld/js.rs:4345-4351 | crates/celld/js.rs:6369-6375 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060entry\u0060 to \u0060\u0026mut InFlight\u0060 in one and \u0060\u0026InFlight\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/celld/js.rs:4274\u0060 calls \u0060advance_io_time\u0060 and \u0060crates/celld/js.rs:6367\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8022ba9551c0142cdef43ccafa5d66b6f9323c3676ddec53f9a9be68d2061a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js.rs:6340-6347 | crates/celld/js.rs:6364-6371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":6340}}}],"partialFingerprints":{"codehealthFindingId/v1":"741bbd0ad62f0e13380c8f47e3ddf34c62e5ba60c374b29f61146d1c70a88e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/js.rs:7795-7801 | crates/celld/js.rs:7894-7904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7795\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7795}}}],"partialFingerprints":{"codehealthFindingId/v1":"3499db9a1b76f2e3726b52d49ad0e0441dcf42ec269c8d0a5c5a7d9bcf3794a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/js/crypto.rs:930-936 | crates/celld/js/crypto.rs:948-954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a10decbc00b639fa24d400454b5f711e223605d80c507e17ea09f442dc470a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/tcp.rs:225-232 | crates/celld/js/tcp.rs:251-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/tcp.rs:225\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, \u0060crates/celld/js/tcp.rs:222\u0060 calls \u0060Some\u0060, \u0060view_bytes\u0060, \u0060get\u0060 and \u0060crates/celld/js/tcp.rs:250\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/tcp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3a785eb28e1a510ac90e39802d87e4e4e8e14cb12976ecc4de4a70110a8339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/js/websocket.rs:500-506 | crates/celld/js/websocket.rs:637-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/websocket.rs:500\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/websocket.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae23250a36893ec855b027b62b99b14e6313827197c6221aabcc7f3d10f52fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/ltx_repl.rs:5035-5041 | crates/celld/ltx_repl.rs:5140-5146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":5035}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc63205c7055aa3770f198f771e909209db0527be57702445106bf96e349fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/node_log.rs:3723-3729 | crates/celld/node_log.rs:3736-3742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/node_log.rs:3723\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef48e068f5c9114a9c16203b43423d6e04959fa6a454a1d5dbc19fb50d12e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/peer_auth.rs:361-368 | crates/celld/peer_probe.rs:212-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/peer_auth.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db91c26ec55c3318ce80644410c4390ec328bfe27b2d87faf26a5167997c5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/logic/lib.rs:4798-4804 | crates/logic/lib.rs:4848-4854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/logic/lib.rs:4798\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":4798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57d40fbbb95a630f9728ef2e2ae4c976791c3954600e9d3c2047ee0b7274fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/logic/lib.rs:5075-5081 | crates/logic/lib.rs:5195-5201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":5075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dd7fc35fbe23e530df4d74ccf49500c211f417ce11a16491a9bb8a717aae0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/celld/js.rs:4188-4193 | crates/celld/js.rs:4269-4274 | crates/celld/js.rs:4339-4344 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/celld/js.rs:4185\u0060 calls \u0060recover_heap\u0060 and \u0060crates/celld/js.rs:4266\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eec949a27ceb4edbc507ea1bbbee8538a08b92e0fcfbed9c66a23b33da06a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/dead_node_gc.rs:414-420 | crates/celld/ownership_store.rs:1234-1240 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/dead_node_gc.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b22b0f1ad63513f5e31c59cb05411d672f8afc3f149987bd46d8d5980675301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/host_services.rs:44-49 | crates/celld/host_services.rs:58-63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/host_services.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":"crates/celld/host_services.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac0539df58a0e46df9085714ecba696df6377d83e14b3d32df784a911d067df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/crypto.rs:580-585 | crates/celld/js/crypto.rs:598-603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:580\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf257e9e98e7cd5a2cc18b8176aa093b92b730fa1a9c0b85b9bcdea8e99bf5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/crypto.rs:1701-1706 | crates/celld/js/crypto.rs:1729-1734 \u2014 both copies are in the same file, so extract the block 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 before the matched lines, \u0060crates/celld/js/crypto.rs:1726\u0060 calls \u0060Some\u0060, \u0060view_bytes\u0060, \u0060get\u0060 and \u0060crates/celld/js/crypto.rs:1700\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5536da6dfb979a53957d3cae64b379cadca1bac429da6a55f5cf1372a83488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/storage_ops.rs:114-119 | crates/celld/js/storage_ops.rs:132-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2586e2a35e81651fc4b8d1f00275dfa9213993ab6e3d2cdaf73d2ddf29052d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/storage_ops.rs:397-402 | crates/celld/js/storage_ops.rs:715-720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/celld/js/storage_ops.rs:713\u0060 calls \u0060get\u0060, \u0060to_rust_string_lossy\u0060, \u0060boolean_value\u0060 and \u0060crates/celld/js/storage_ops.rs:396\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f619318883815f5f26cad9db8b128018edbec3bb77b13101b6c5c12890960b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/storage_ops.rs:794-799 | crates/celld/js/storage_ops.rs:832-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/storage_ops.rs:794\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a35bc873756a0160aff77968ecfb0bd32367f338d5dc6e38da23529f5c47cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/local_store.rs:98-103 | crates/celld/local_store.rs:123-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 \u0060crates/celld/local_store.rs:98\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/local_store.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f87fbca2241edd3cdf4dcc5203fd8daed35dc95e52d2030bf12681b81de72d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:3812-3821 | crates/celld/main.rs:4005-4010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01857ff41dc2a7958ed4d246a77558c556989e41daf7ecda7010c6a1908da6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/otlp.rs:172-178 | crates/celld/otlp.rs:207-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 \u0060crates/celld/otlp.rs:172\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/otlp.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baed16ec9e5c18a1cbcf7ee8f671e38bf1d639f6dbcdb5051a52022166b7804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/logic/lib.rs:5640-5645 | crates/logic/lib.rs:5740-5745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/logic/lib.rs:5640\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":5640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff51d8caa153f0a64de25539ff8f1caaafa3982ebde888fb88d5d6a5bffc893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/celld/js.rs:4265-4270 | crates/celld/js.rs:4315-4320 | crates/celld/js.rs:4335-4340 | crates/celld/js.rs:6336-6341 | crates/celld/js.rs:6360-6365 \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 \u0060crates/celld/js.rs:4265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/js.rs:4274\u0060 calls \u0060advance_io_time\u0060 and \u0060crates/celld/js.rs:6345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":4265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0763568c795856eeff94f09bcd04907fd8059dd8ec159c7f17cbea8b34fff3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/celld/js.rs:7739-7743 | crates/celld/js.rs:8463-8467 | crates/celld/js.rs:8720-8724 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7739\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7739}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c6bb07bb6c59c96e07ec16476016160f6e93c461c267c9c0580a72d6372f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/celld/js/storage_ops.rs:81-85 | crates/celld/js/storage_ops.rs:182-186 | crates/celld/js/storage_ops.rs:429-436 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/storage_ops.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"711db6e56646c074423e938420a01fe67cb5da495db2ee4f75b39f11518cb434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:9834-9838 | crates/celld/js/bootstrap.rs:405-409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d683867ad21f7e02fc3dd0868f73792b5a3c230354e1c034d0e9c33f731b0469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js/crypto.rs:1356-1360 | crates/celld/js/crypto.rs:1374-1378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/crypto.rs:1356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/celld/js/crypto.rs:1379\u0060 calls \u0060base64url\u0060, \u0060to_bytes\u0060 and \u0060crates/celld/js/crypto.rs:1361\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"610d078ded853261179cfed995cb41f7b18dd4f9aeeac0061be84d763f9ebce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js/tcp.rs:158-164 | crates/celld/js/tcp.rs:291-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/tcp.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/tcp.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4df1726d11984e625de553d1f80802f7776b34247f7ba2b869995209edbce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:5094-5099 | crates/celld/main.rs:5290-5295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:5094\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"676572326cec3798ba220e653c4611032f0767cfa6389fb6a552f8991d070d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:5101-5106 | crates/celld/main.rs:5297-5302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:5101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5101}}}],"partialFingerprints":{"codehealthFindingId/v1":"276596249ed886d9e2b78d7e78a145acdba1775e3412bbd1925cd36fcf8aab68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:5114-5119 | crates/celld/main.rs:5310-5315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:5114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eff4869df1e8eb883ce2869c46d4b268290a7d5e37135260c3afc970d02c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:5121-5126 | crates/celld/main.rs:5317-5322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:5121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5121}}}],"partialFingerprints":{"codehealthFindingId/v1":"479869cc48896d06872d55e458fa591837822957fa704818840c7d0417635c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/peer_auth.rs:381-387 | crates/celld/peer_probe.rs:232-238 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/peer_auth.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"141762d05809a43ba6d7dd1f4b71beae86b49ab0d15477e8876b29c78a773443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/celld/js/tcp.rs:136-153 | crates/celld/js/websocket.rs:349-365 | crates/celld/js/websocket.rs:475-491 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/tcp.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2423fbaa3ac861250e0eb1052115fe164c5528bbd6089197a29d8ee62ac3e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/celld/deploy.rs:1514-1526 | crates/celld/deploy.rs:1707-1719 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/deploy.rs:1514\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"75efa335eaf126161c238d7124328fbc1dbc2ef6a5230c9149fa44629cd1b682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/celld/main.rs:5072-5082 | crates/celld/main.rs:5272-5282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a7289bf175720a157a027e2fbedfd61ed0f0284d73258befd1abb8c638fd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/js.rs:7170-7179 | crates/celld/js.rs:8741-8750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0de7da06166c2fe0ed19317d653c635f079ed436547657e5e2c06e665f3493b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/celld/js/html_rewriter.rs:185-194 | crates/celld/js/html_rewriter.rs:434-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/html_rewriter.rs:185\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b668ad9d4b32360e79878eb713900235cca4859b7dfe863e0ed715893f0211ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/main.rs:4862-4870 | crates/celld/main.rs:5342-5350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:4862\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4862}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4825258f6f503f3bf16c111eecc8523dacc9f5fcb1cb57720a89261120f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/storage_ops.rs:1151-1159 | crates/celld/js/storage_ops.rs:1171-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/storage_ops.rs:1171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa853e0cba1253f631f812e4c2cd57bafdb88ec19500e9172c994bbe8948de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/d1_cli.rs:109-117 | crates/celld/kv_cli.rs:139-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/d1_cli.rs:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/d1_cli.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2255930c65ea812c3b8011506881a1c68899057ce30cd96c44dd719ce370a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 4): crates/celld/main.rs:3890-3896 | crates/celld/main.rs:3899-3906 | crates/celld/main.rs:3907-3913 | crates/celld/main.rs:3939-3940 \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 \u0060crates/celld/main.rs:3890\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, \u0060crates/celld/main.rs:3889\u0060 calls \u0060filter\u0060, \u0060is_empty\u0060, \u0060collect\u0060 and \u0060crates/celld/main.rs:3907\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cffec103ed3def8015b6a46a43c0beb2aea6432df4c0e0f087e2ea9a81923cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js/storage_ops.rs:34-41 | crates/celld/js/storage_ops.rs:764-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c35ec5c8e5957a6212fe2e50285477434568e4a900ee2aa6435de7af89cedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/celld/js.rs:7788-7795 | crates/celld/js.rs:8476-8483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:7788\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7788}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc1484c299e79d27b3369afce20555b97ce12dbd1fe89d7e76a6a97e338cc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/celld/bucket.rs:786-792 | crates/celld/bucket.rs:815-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/bucket.rs:786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/bucket.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e83065f25d55c0d2f567f56a82edef1719383683a20d8f522fa4940237987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/deploy/python.rs:353-359 | crates/celld/deploy/python.rs:438-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/deploy/python.rs:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy/python.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7457fd6ef9f057450feb39381d9a03f40be0a77e0be02241637001108db1780c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/celld/main.rs:4791-4797 | crates/celld/main.rs:5108-5114 | crates/celld/main.rs:5304-5310 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:4791\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4791}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7644369e68250e3d361f50a146e67e96330b6b1058c2f1551060c8099f65526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/celld/js/r2_ops.rs:135-139 | crates/celld/js/r2_ops.rs:409-413 | crates/celld/js/r2_ops.rs:562-568 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js/r2_ops.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/r2_ops.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ef42206ad49e3fe7b68e669aacd088ff940c4de8b3435437e2142177efe196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/celld/fleet.rs:829-835 | crates/celld/fleet.rs:839-845 | crates/celld/fleet.rs:865-871 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/fleet.rs:829\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2970e1af3543a8b1eb4450ab068bdd6cb48ec33a5af0d0f4eeffb772cdd9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/celld/js/crypto.rs:791-797 | crates/celld/js/crypto.rs:930-936 | crates/celld/js/crypto.rs:948-954 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace33269576d85c292c7f6ee6f84532e90ff8f942034b9063c5a487be9e281cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/celld/main.rs:4808-4814 | crates/celld/main.rs:5125-5131 | crates/celld/main.rs:5321-5327 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:4808\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5578f2b02850d385703962db1f974fb369e51f5b5281f6bb8107c2a181066a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/celld/main.rs:4771-4777 | crates/celld/main.rs:4787-4791 | crates/celld/main.rs:4800-4804 | crates/celld/main.rs:4807-4811 \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 \u0060crates/celld/main.rs:4771\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed065e32a968e281cd424876a093a0f6495941c2afd400bda6d378b0cff19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/queue_policy.rs:148-153 | crates/celld/queue_policy.rs:179-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/queue_policy.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d2c65a82367b91efaa45dcead87fe2d1ef876f53055b003c1ef02a2e71c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/celld/main.rs:4781-4786 | crates/celld/main.rs:5098-5103 | crates/celld/main.rs:5294-5299 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":4781}}}],"partialFingerprints":{"codehealthFindingId/v1":"29122296e985ab116a281058130a8605a055150a3b82ff9fa685b2d2a049607c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js/storage_ops.rs:1105-1110 | crates/celld/js/websocket.rs:760-765 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"crates/celld/js/storage_ops.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9539abd035ccd272a3dd9db4ec5c4c6bd33bf544a6637dfb8a394b13c9bd96c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:5912-5916 | crates/celld/js/bootstrap.rs:375-379 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:5912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff45ab656d3080132f3e577a962ed87afa5c6cb377450ad2b938f911c28e2586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/main.rs:5132-5136 | crates/celld/main.rs:5328-5332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f9d61cabe68a777ae009802f162509e05bf7b08ac58480858b6df536e6a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/celld/js.rs:2806-2810 | crates/celld/js.rs:9817-9821 | crates/celld/js.rs:9835-9839 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060name\u0060 to \u0060\u0026str\u0060 in one and \u0060Option\u003C\u0026str\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"53548f6d6f223d8f3eb34e69b6007e2dca48f78be0a6ce7744cc3512df3c71c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:5339-5343 | crates/celld/js.rs:5405-5409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/js.rs:5339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5339}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ead64363364745441baaa6295c0b1215b1925b897a87bd973a761c47a1bb14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/celld/js.rs:9815-9819 | crates/celld/js/bootstrap.rs:404-408 | crates/celld/js/bootstrap.rs:747-751 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e7c1dfe04d9a7d2f8e4b170660b51d8aff442016958f990ca53575b1d15c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/assets.rs:156-160 | crates/celld/assets.rs:610-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0bb4a8f317d48e801078be35e53d345fdc6bef54095ba2204e1cd3809ef519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/main/websocket.rs:79-83 | crates/celld/main/websocket.rs:197-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5584708fef05ba9b685f02bac36388ddbcab31f7bfba9df72c9c2572deb2af89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:2805-2809 | crates/celld/js/bootstrap.rs:518-522 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54a336b14b611f06439eceb11c43f29f54de5ae873ef2ccada60387343743f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/deploy.rs:1157-1161 | crates/celld/deploy.rs:1290-1294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fea3330313066b84fde8bb73ff98768c679e31aebf77a6afafb1d107850c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/js.rs:5980-5985 | crates/celld/js.rs:5990-5995 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":5980}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8730b9e3e9f3da4729189d6eb373fe5a6b317ab32584dd5519b8c43bf7bbc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:6138-6142 | crates/celld/js.rs:6221-6225 \u2014 both copies are in the same file, so extract the block 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn facet_opening_for_test(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":6138}}}],"partialFingerprints":{"codehealthFindingId/v1":"819fc63ddcc5e4323da58f4f4724b8ec7b6db9693750129bd7192f8e47bf31e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/celld/js.rs:10526-10530 | crates/celld/js.rs:10574-10578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":10526}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf3677fa5c41dca7689f11401f584654cc63c0bf7e6b69bc3f45be002b308a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/celld/main.rs:5087-5092 | crates/celld/main.rs:5283-5288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/celld/main.rs:5087\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":5087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec72e3cb3ced5e235a6cb8f7df636920696ae9a59e851fed736e489ec6b84fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/celld/peer_auth.rs:371-379 | crates/celld/peer_probe.rs:222-230 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/peer_auth.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"10788c79cb75aa473b0cffd84c7e78d4a7997f70be93bfb3b1c77eddd44e36c1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: celld-logic: celld-logic: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"95639d3e9cf83982b32e0f04863894afcea6265256bb6891ab1140639bd71364"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WorkerConfig (LCOM4 14): WorkerConfig\u0027s methods fall into 14 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 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c862f4058dcba2824646b5e6c9cec18e91f001957104f5260010f7caabb5718b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IoContext (LCOM4 9): IoContext\u0027s methods fall into 9 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 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":10913}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4edb66a564c0930d89eb53a44e6aaa9a065d48b744ffcedad5e1c384050373"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuntimeManager (LCOM4 9): RuntimeManager\u0027s methods fall into 9 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 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab81e7be3599f450a0bba14dbf6e0776a5c60545232dfad55e533bfa03db61"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LocalStore (LCOM4 6): LocalStore\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/local_store.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf6fa31bdaf430ef88e77f21188775c0f5fdf15500f472d6a88c13877c72b9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TransientCloneDelegate (LCOM4 4): TransientCloneDelegate\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"634f03ba601cf3f317af988ab133b1b3e2b2cb6bb630ed5f6da28f1c3632f5c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/main.rs: crates/celld/main.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 254 in celld::async_main at line 3461. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4661a54513c10fe4d720dfe6247d253404aaff12ebf4bd8e59b770c472d0bc74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/deploy.rs: crates/celld/deploy.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in celld::deploy::read_project at line 1287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/deploy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e82d14b85183a01ce98e3a135f9966f39020f586d61c4859f8b7abd184a244"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/logic/lib.rs: crates/logic/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in State::validate at line 1304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/logic/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/logic/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4e74ab76450548ed4f36fb5b5976f9279ed0e569e15ceff3930222868e38a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/actor.rs: crates/celld/actor.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in Actor::execute at line 3254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/actor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c522b37a8e1a94680913da0ef87e94eaf2ef0ca9229dc2ec6d6df8da2bf80f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/ltx_repl.rs: crates/celld/ltx_repl.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in celld::ltx_repl::ship_loop at line 4816. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/ltx_repl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ltx_repl.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1205867ab9fc3bcbcbbe0caae7644975f1aa74058a629d4c2f473b44de76fd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/runtime.rs: crates/celld/runtime.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in celld::runtime::wake at line 2385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/runtime.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e071b3de5c503792685108591c5a843f8525b0b9f769aeea4e46b147a7aaad6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/js.rs: crates/celld/js.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in celld::js::op_loader_load at line 7415. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/js.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"1801a221e67541cabf68a0f6739f7a834720aa587405ffa6abc41d8eff344de0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/js/harness.js: crates/celld/js/harness.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in harness.__stubLift at line 4202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/js/harness.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac40f437900d33938d60701ac57409c32bbe8c6ea6b9699bf0fd02a67c535918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/node_log.rs: crates/celld/node_log.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in NodeLogManager::recover_serial at line 4919. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/node_log.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/node_log.rs"},"region":{"startLine":4919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11fd66c6412f9ebd6859c27ca8fdbf3cc589ccdf4d2b1ccc7db9c39840d74a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/js/crypto.rs: crates/celld/js/crypto.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in celld::js::crypto::crypto_operation at line 627. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/js/crypto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0856207d76892f04f8fb0ec767185c1889dcd0c57af52fa814a15984c236e11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/main/cli.rs: crates/celld/main/cli.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in celld::main::cli::action_from_process at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/main/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f976ae8a69d2c0746b61678e1f23ea7bf1f0fcbc5e2432e530b38de55cc1041b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/storage.rs: crates/celld/storage.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in celld::storage::sql_cursor_start_values at line 1915. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/storage.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef3096a61ccd9e7c6a716073d9a4b39d0acdb092aabcb2e70d3b08d1e33bd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/control_plane.rs: crates/celld/control_plane.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in celld::control_plane::handle_explorer_request at line 1112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/control_plane.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/control_plane.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd6fbedb5483f44cc0818d608145ff777061985a13d34fc32e58c9b69288414"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ltx/src/db.rs: crates/ltx/src/db.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Db::sync_inner at line 1417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/ltx/src/db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ltx/src/db.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0321d5a193887e7cde6c221d4a0ffec0c34611bfe0852697be97b39c12ae90f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/js/crypto.js: crates/celld/js/crypto.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SubtleCrypto.generateKey at line 464. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/js/crypto.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e49b952f7486f6fd70a09af6ed3ab6ecaecff134d0b44957a2b5204a87ec80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/js/storage_ops.rs: crates/celld/js/storage_ops.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in celld::js::storage_ops::op_sql_cursor_start at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/js/storage_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/storage_ops.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"df076292e74f20babbc0daf4575a25af1f31e1adc2f114b6129d5b383a661c4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/main/websocket.rs: crates/celld/main/websocket.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in celld::main::websocket::handle_websocket at line 1070. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/main/websocket.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main/websocket.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3dcc16540e2c93fc87407537ea1b3b835395e462541bcd16ac685d06acfae9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/celld/env_vars.rs: crates/celld/env_vars.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in celld::env_vars::validate at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/celld/env_vars.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/env_vars.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"533bbb36ae1a4d811b092453f26947a1845f453a015b69454c99a0998dc902c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ltx/src/replica_compactor.rs: crates/ltx/src/replica_compactor.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ReplicaCompactor::compact_with_progress at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-23 22:40:37 \u002B02:00\u0027 --until=\u00272026-10-21 22:40:37 \u002B02:00\u0027 --full-history --no-merges -- crates/ltx/src/replica_compactor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ltx/src/replica_compactor.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e43dda947960a81740ed3853eefabd7eddbf945f772d4db3279afa74261884"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/celld/Cargo.toml\u0060 makes this repository a deployable product (line 12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/Cargo.toml"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca78883a314c481fa00e6ff0286504023b4174c6e2b11450f2daaa97c052a36c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060crates/celld\u0060 (121181 LoC, 526 module-visible types across 8 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a026a3eb7cd15b3a5357c8fb99723041171195b53d4226265d0e082cca4f871"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49c16b6fbc91670e61b639ab9c9270b4df42b6b11889eae216a02e4dd9c52b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"549c0c0bd34576105eabc9c83fc9e11e627c8a2da3379d21723579dacff184b7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acd15f2850dd121070e3c04e579a7dd1af9d65301f593a4565d26f07b985fdba"},"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"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8b56acc822032228d4ee0db7d5ad5309cc13e7d8de225309ce243c2c79d2234c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05bd00d1c6030847f88cb0616a27c5baf495592e7e7dbe46c892f171e3c298c6"},"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"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"4ebe8ff7dea44678488a050ec5ff6eaabf0861ca4ea2c6fcc25ee463e2237326"},"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"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"076632a5077499e72bfc0e4bd03c485bacbb8a94f0d2db13635a2a322b77f0d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f80afe1a0e1dcab0691480c050d901b08f77156896201ff2406e669a4cf6a2"},"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":"8079a37dd24a0d74b56e39eb3bf8163888a6460994d4e6d0f7b26be5b3185567"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3c06a5ff55965930b29a3b87aa83af67012deaa6773fa6a6050fb466e8a1cba"},"taxa":[{"id":"CWE-1164","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e3698eb6b449825211eb55c8305de9959b9d32e3296530c8bf42afeee6cae3f"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.28.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":"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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.38.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","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.4","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":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfef4dce318a38e626316269e58f0db5d8bfa407fb05d90ba944cd8f23f781c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-content-type-options: The live app\u0027s responses did not include x-content-type-options (stops MIME-sniffing (expects \u0027nosniff\u0027)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e7f2638203ac91f5b64c739d090b339c00a90f1007c83652152b402a6eb0cdeb"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXI1","level":"warning","message":{"text":"Container process runs as root: wd-runtime-app: \u0027wd-runtime-app\u0027 (wd-runtime-app:scan) runs as uid 0 \u2014 no user was specified, or one resolving to root was. Observed on the running container, which is the only place the answer is settled: an image\u0027s own USER, a base image\u0027s inherited one and a compose override are all invisible to a Dockerfile reader. Advisory evidence for CRA Annex I (2)(b)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58b66476748e6ab31dcdd8e06ee148353a48ea93e873dd96c2aaafa81bc630fa"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M3","level":"note","message":{"text":"No tests/ separation: Tests aren\u0027t where this ecosystem separates them \u2014 a \u0060#[cfg(test)] mod tests\u0060 block beside the code it tests (with \u0060tests/\u0060 reserved for integration tests) is the convention, and none is present."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"999e0c784909c76b6346a705ee63961fe363ed1cd6a94e3f80e2ebe7820ccd5d"}},{"ruleId":"P12","level":"warning","message":{"text":"Test suite runs only after the merge: \u0060release.yml\u0060 run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) \u2014 so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"731ad560de6aa35d3e92103d5ad0fbec4c54f771b709281e852941847e03ef03"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060examples/container/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/container/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4a887bb9c2e44e117390c49ded628ebace6ecd4d8a1eeebda16b9ff6be1854"}},{"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: \u0060async_main\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/main.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff9cae8f6450ee2de7176433fcf298d1ac5d8713ab5d26f607c92b7975f206f"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 34 plain JS \u2014 the untyped files are crates/celld/js/atob_btoa.js, crates/celld/js/byte_streams.js, crates/celld/js/cache.js, crates/celld/js/compression_streams.js, crates/celld/js/crypto.js, crates/celld/js/event_source.js (\u002B28 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): crates/celld/js/node_path.js:551 \u00B7 crates/celld/js/node_path.js:948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b8f6811ce6d746263629df09251b2bf46e0ac73e913862f0cdad9395e4622b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): crates/celld/js/node_path.js:386 \u00B7 crates/celld/js/node_path.js:841 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"109fa810a5157d52b17dc66ab621af705d4d512d6a41344820437de7777033d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): crates/celld/js/byte_streams.js:585 \u00B7 crates/celld/js/identity_transform_stream.js:279 \u2014 the two spans are one implementation copied and then locally edited \u2014 182 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee53d965484059901ec7922d39c41c2fd5ce64bc44c8b81640def7a57f9c711"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): crates/celld/js/text_encoding.js:54 \u00B7 crates/celld/js/text_encoding.js:97 \u2014 the two spans are one implementation copied and then locally edited \u2014 296 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":"crates/celld/js/text_encoding.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4160e08264a54fb9d0a7c4d608f4d1d2fd6b1fac076b1fd0705d30e90be4068d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/celld/js/html_rewriter.js:181 \u00B7 crates/celld/js/html_rewriter.js:220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b3fb727bfa521d5d1006b5c7854c9c3deaa93c68a1010b896f4c2c63184436"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): crates/celld/js/node_path.js:421 \u00B7 crates/celld/js/node_path.js:874 \u2014 the two spans are one implementation copied and then locally edited \u2014 148 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":"crates/celld/js/node_path.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"304f2ee0aaa14b900a530f2db04176875209bc69da209ae0a2ae156bc703c0c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): crates/celld/js/harness.js:342 \u00B7 crates/celld/js/harness.js:508 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"832428f250b1bb161a4a4e49bd62ce785fb5d924008cdf3b39dde966d60ea10f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): crates/celld/js/node_path.js:174 \u00B7 crates/celld/js/node_path.js:255 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"79437e28fa014f39e13251af67d7f6065f2131166651e58adcb5d433e4eaf8e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): crates/celld/js/node_path.js:607 \u00B7 crates/celld/js/node_path.js:703 \u00B7 crates/celld/js/node_path.js:1001 \u00B7 crates/celld/js/node_path.js:1059 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ca37071cc06006cb391e147fd3c87e5689969bf7e2f1bbf8ce7fe5df91f19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): crates/celld/js/crypto.js:670 \u00B7 crates/celld/js/crypto.js:713 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a62476384c50cf244155f9270b505b0897655aa27677431c378d46448bbd72a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): crates/celld/js/node_path.js:481 \u00B7 crates/celld/js/node_path.js:653 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386e8d1a6db70a9aae27793cbe177e6c8d8bfb9004af1926c72922ff8c5861c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/celld/js/byte_streams.js:475 \u00B7 crates/celld/js/streams.js:387 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f9a38a03fa2ad292f36ae36f80f5f80505afc0989d4b27d4e90ce6919c1873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): crates/celld/js/headers.js:199 \u00B7 crates/celld/js/headers.js:236 \u2014 the two spans are one implementation copied and then locally edited \u2014 103 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":"crates/celld/js/headers.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f1bc3c40319d1d0be6ea2ba9a3d001a241e4f04046899f8b464f2649980955"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/celld/js/node_path.js:722 \u00B7 crates/celld/js/node_path.js:1079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e963a47cb8e868c87bc3d0c283ea7dc1411da42177dadd1fe34544526960480"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): crates/celld/js/services/kv.js:357 \u00B7 crates/celld/js/services/kv.js:420 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"crates/celld/js/services/kv.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"152f6dd84af3a8a018c1aa95f6d48ed241bc917517747c13623cce5c15781571"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/byte_streams.js:26 \u00B7 crates/celld/js/identity_transform_stream.js:46 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbc3aaba74abb4d856c585f268e1a5000605d51f2ba31a783142217db66c906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/harness.js:125 \u00B7 crates/celld/js/harness.js:842 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0cba1585e0e0d75e3f0340be8873e26c4df51073b54f69a566095a16422bc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/harness.js:4247 \u00B7 crates/celld/js/harness.js:4892 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e616230b26dce40e2a6194e165552230e217c312c0cb1d809edf930e0eb54c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/node_util.js:652 \u00B7 crates/celld/js/node_util.js:682 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54ffb391958048f3c98a20f6a58c760d1327234671687250d13982d302e06a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/node_util.js:1817 \u00B7 crates/celld/js/node_util.js:1829 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"990d88e5d7ee9a684d34db2d82cda0118de37731f94bcf6b3a9c261d3ea7eb03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/node_util.js:3065 \u00B7 crates/celld/js/node_util.js:3090 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d9f47a36e6db9f9ebe08045dff41d0dc11432ec281c50b1a699cb3d4bac333"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/celld/js/node_util.js:3429 \u00B7 crates/celld/js/node_util.js:3475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"09788f9cdaa37699679d34b0550734d01534355fd4518641ccc3ee39c79a3744"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/celld/js/harness.js:702 \u00B7 crates/celld/js/harness.js:771 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23544f50aca7b61836d0b7573f8c56f5e63f071e74ea897874bacfa3d43a4ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/celld/js/harness.js:844 \u00B7 crates/celld/js/services/kv.js:945 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b59b2c2d2b606f424f913c471c8c510e9cbcfaf52ce9af92f20deb94dd60e1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/celld/js/identity_transform_stream.js:178 \u00B7 crates/celld/js/identity_transform_stream.js:221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/identity_transform_stream.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39d9d9090073f77840403f3abc88729f7e5f7f661e93cf5d7e6b6f57dc4d87a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/celld/js/node_assert.js:235 \u00B7 crates/celld/js/node_assert.js:264 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddb46c53f7994c3839a84fb2671f94507d9d31ce9021f75d3ccd8ff2860d7e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/celld/js/node_util.js:2663 \u00B7 crates/celld/js/node_util.js:2682 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"176dd4868a26b828abf36d3ea453eabd71704be4f21055f82992eb2cc5c0dc0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/harness.js:1445 \u00B7 crates/celld/js/harness.js:1455 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d98c396ffaa5046f2dfeb3678dbd1db49a616c0a130c81102ea018783fa6b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/harness.js:4501 \u00B7 crates/celld/js/harness.js:4948 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b86c1f0f11f9e253549c4fea9848e83a1c9083968626f8741956e5046dce02c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): crates/celld/js/node_diagnostics_channel.js:150 \u00B7 crates/celld/js/node_diagnostics_channel.js:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"crates/celld/js/node_diagnostics_channel.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2599857b32016c79b904e80f8d24a9bc8cd640486ccdeb65560857ab6f5a0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/node_path.js:244 \u00B7 crates/celld/js/node_path.js:490 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2906b4e7dccc13f1c52d600018b5201fb2c21406c609f9a5e3e1db0e3010e22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/node_path.js:529 \u00B7 crates/celld/js/node_path.js:927 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e197f1ca95c06a1eef7c10640daabc9ed8bd710b09cb8d1c7ca52651f00c61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/node_util.js:666 \u00B7 crates/celld/js/node_util.js:681 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"360cd04d84df36cbd76e5758d9051942ebf3a36567028de11884d2eaaf9b0b9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/node_util.js:704 \u00B7 crates/celld/js/node_util.js:801 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d17a33b8cf4a433cd3c5c01a617b8320c5d230809e38cda1ea8b5e253b598f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/node_util.js:2651 \u00B7 crates/celld/js/node_util.js:2670 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e7edbe59007f7c6ffc2b6a829a661480996dd355b09de319629bd99b46f02e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/celld/js/streams.js:733 \u00B7 crates/celld/js/streams.js:744 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e498e8e6429e0854824c7759b26535ead19569e40d6ef462ca9753c6fb74b65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/celld/js/crypto.js:601 \u00B7 crates/celld/js/crypto.js:647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c73c22f1274945d93b66d351af399f57f711874d065b559ece61d509c6866d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/celld/js/harness.js:255 \u00B7 crates/celld/js/harness.js:407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45662a962c48662e2c7c20d57fd91095852cab76c2d6f29b1d4d318e01d1b06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/celld/js/harness.js:2761 \u00B7 crates/celld/js/harness.js:2775 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"537a85a615b06306fae1551e7001d0cc40c672742f945784a34e4f9539d5741e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/celld/js/harness.js:8960 \u00B7 crates/celld/js/harness.js:8980 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8960}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12ee6b5a3461bfe4567f2d7b83c5f1c77e94bef6a0f21c60fb04034f4bad58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/celld/js/node_util.js:598 \u00B7 crates/celld/js/node_util.js:607 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b98ffa2173dd7c019b2b97071183a0fc6e0609b0b231db49c64195f4bd247"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/celld/js/harness.js:8468 \u00B7 crates/celld/js/harness.js:8661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8468}}}],"partialFingerprints":{"codehealthFindingId/v1":"610915265c5e0afb12ab4e43c38b700e4e2ea8869a548611f46973fe5d30235b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): crates/celld/js/harness.js:8848 \u00B7 crates/celld/js/harness.js:8867 \u00B7 crates/celld/js/harness.js:8957 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6916acd7cfdf9be5846919783e1b0547b1da5b1c741c52d668975bce87b775d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/celld/js/node_path.js:945 \u00B7 crates/celld/js/node_path.js:998 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"801aecad4d69de1b8f0c90fd5e8c8b06edb71d33ee6871c1ad894140b3d73253"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/celld/js/node_util.js:442 \u00B7 crates/celld/js/node_util.js:456 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5511b49605d3c41dacddd59ac42d505a6c53ec0a0a5c5d50462d2c9b4e2fe91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/celld/js/node_util.js:4020 \u00B7 crates/celld/js/node_util.js:4028 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b5fccb430f57138e9ac6d1ddea3e3c519b2d549182dc951e24e228b0fc69b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/harness.js:2229 \u00B7 crates/celld/js/harness.js:3307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"315258e8facd343565a5d74869e132071e7da593d1268346ec46c30aee6a0d52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/harness.js:3365 \u00B7 crates/celld/js/harness.js:4871 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9304ccee31c717e0b66e71cf23923e51e1683ef504874aea77ba714533b1ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/harness.js:3742 \u00B7 crates/celld/js/harness.js:4872 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61fa687b5f04caa29d1204e2462a9f6ad434a77fb810aa25f8af9b1dbeedd16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/harness.js:4025 \u00B7 crates/celld/js/harness.js:4548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e477e10837328ca92227c9b7b6429fa5831752aba63b985d60ba02610f687"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/harness.js:5513 \u00B7 crates/celld/js/harness.js:5531 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f27cc17feb59e7397b53a92c8cf23fe56403fefc3399fcfbef35d1459edf36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/node_path.js:303 \u00B7 crates/celld/js/node_path.js:813 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce1f291fe5c8cc6e0050e0ffa405a4bf01dd631cb2a500017a9a3aedd1d7d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/celld/js/node_util.js:743 \u00B7 crates/celld/js/node_util.js:750 \u2014 all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"4569ead40fd0d68db2d9946b86996397fb76964bfcd548ab6f75ab1453906184"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/harness.js:2249 \u00B7 crates/celld/js/harness.js:2263 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a56badba6ebc10fa9251f336b54eccb9d8d1038aaf75adff0b4497c02d54c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/harness.js:3776 \u00B7 crates/celld/js/harness.js:3784 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3776}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a390c6c6b7ac89ca70a865bf25d45b4737299e34378f6171609adb5f811cbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/harness.js:9685 \u00B7 crates/celld/js/harness.js:9862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d960727dc33e2ccbf37485b4269b2a6cc244d3a912fb97a5e70452e939b14e47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/html_rewriter.js:397 \u00B7 crates/celld/js/html_rewriter.js:403 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"01909b9a5354b252d465f858c6beecdf95f81f48f9279459778da7fafb7c791a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/node_buffer.js:508 \u00B7 crates/celld/js/node_buffer.js:514 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8641ff95fafdc0c3acab9bc938daf21cabe78afc826420b4d5a182a66e4b49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/node_buffer.js:645 \u00B7 crates/celld/js/node_buffer.js:659 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58cd0206858cd0c2bd25ec6c3237c9c4cd9aab972560ae027d2ba8dcec5ebdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/celld/js/node_path.js:636 \u00B7 crates/celld/js/node_path.js:1028 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bf68011a73c99ba007d72b8153ef9eef9359304c7da5ee08ec09134d063689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatRaw (cyclomatic 99, cognitive 160): formatRaw has cyclomatic complexity 99 and cognitive complexity 160; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e3d2a2b162d2c090ebbe4089920917180c42dbfc9a578771100ecb6493c8a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function innerDeepEqual (cyclomatic 71, cognitive 86): innerDeepEqual has cyclomatic complexity 71 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac72b15944ed73ac69b9236e30a2a3e3ec8e4586ccd9212b9af84b913704b63c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lift (cyclomatic 48, cognitive 60): lift has cyclomatic complexity 48 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a779150d80fc0b5990d229294c677d6ee26ccd63b75b4bf7e3d6e3066d3de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relative (cyclomatic 42, cognitive 67): relative has cyclomatic complexity 42 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e0716812eeb6ac7d68ae9c02900e2d9cff1e6cf63d7b226fff9a0b6b45e779"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 42, cognitive 45): constructor has cyclomatic complexity 42 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":"crates/celld/js/harness.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"62adc53b0132d7f371261f4299641e65dab47100b14812524c13d2a77bf4c8dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __parseFormData (cyclomatic 41, cognitive 74): __parseFormData has cyclomatic complexity 41 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2768a8f18a94c23ca51ff8eab94a2e66637bd9e8d0e4ff56a449ae8241eb21bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 40, cognitive 71): parse has cyclomatic complexity 40 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ec742e5c119637f081441ae7b53724f80d100ba1d7566778305d28c42c6750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deepEq (cyclomatic 38, cognitive 50): deepEq has cyclomatic complexity 38 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c294b101b51dfa846afc26fb8d3a1c1d3dc2c5d70a1de53ee90c98a3115e3c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 37, cognitive 35): project has cyclomatic complexity 37 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a64bb042af24416fbc91c8bc786c1adb378fd5eff91255895699edace7f768"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 36, cognitive 86): resolve has cyclomatic complexity 36 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5052c76c47d92055d392ed8f67b5c6ef7a80b5ba44d804e9fa9195e63a03e58d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isFullWidthCodePoint (cyclomatic 33, cognitive 29): isFullWidthCodePoint has cyclomatic complexity 33 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fe938a73382f3f5e7b5af20790dc105cba14fa56b980fc4572b0d5fd8f22b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatWithOptionsInternal (cyclomatic 31, cognitive 65): formatWithOptionsInternal has cyclomatic complexity 31 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"14faa9ee60399f7385032b5221acadeb28da320d19a98c1087428ec5b7c5ff95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function from (cyclomatic 31, cognitive 36): from has cyclomatic complexity 31 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d936733687196f9c781f04195017a076546fa52c8de09f42b420114ba662b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 30, cognitive 56): normalize has cyclomatic complexity 30 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45e4d4048fcf290f700127b918aea71697df6adce34d342aab6ca01cf25567c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatValue (cyclomatic 29, cognitive 49): formatValue has cyclomatic complexity 29 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9adb73cfbe84516e7ba38eb53218ac7d93367ef9514123a404e1ba281e8899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dirname (cyclomatic 27, cognitive 56): dirname has cyclomatic complexity 27 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d87c067a89666505658b3b4991ba23f96b35454ce3b9bc2cfdfc2f477bd6809"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fill (cyclomatic 27, cognitive 31): fill has cyclomatic complexity 27 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f6b47c73ece11292b9e0f7b1a08209332f6ce4c2cf3ea011ee3cf4749c47f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatProperty (cyclomatic 26, cognitive 41): formatProperty has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"033aec9d1eedb8f8039786e6838cd3f15aee28dbdeafb695a8a97e33538d690d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relative (cyclomatic 26, cognitive 36): relative has cyclomatic complexity 26 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb210d7ff484c8e22b0028f9fb560134000a455cfccbbd672b2dec8e0a479ade"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revive (cyclomatic 26, cognitive 32): revive has cyclomatic complexity 26 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":"crates/celld/js/harness.js"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75a1213ad472ce588f49770b093f3aa310ebef767c02b73d454657a883b38f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeModules (cyclomatic 25, cognitive 39): encodeModules has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf49043ccf39e5957f1c48202c158e453ab9e9279f68fc18ed3f92bc24539ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyCheck (cyclomatic 24, cognitive 44): keyCheck has cyclomatic complexity 24 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"698aaa1565489c608ab0887d60876e67d64a21533efe2175501171947dac3233"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateKey (cyclomatic 24, cognitive 43): generateKey has cyclomatic complexity 24 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0508954d418e0f8747fce4268ecd9aaebf710a5fdbca1e0b40530eb23e9927"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 28): constructor has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"75073c7d038140ab8a3ad3fbeb982ea05ca00c722124ed4fcc1a24187ac97e01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 27): (anonymous) has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95a62b64a0099e9649ac637f903d99461db0ac2eec246e9fd2f0949bbfcb7a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basename (cyclomatic 23, cognitive 48): basename has cyclomatic complexity 23 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79029c1ee6f30fbc44f6a1fe11b2fc94bb387a2f5e12896318aa1ab59106eb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupArrayElements (cyclomatic 23, cognitive 45): groupArrayElements has cyclomatic complexity 23 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":"crates/celld/js/node_util.js"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be7b7258a22e455f5338612409b1d8a5399213828f68b810a9ab6ae45aaa6c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function strEscape (cyclomatic 23, cognitive 31): strEscape has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7a13ca6cca8fb46138ce1b698586f5ba199910ef2485095f5adc7ab8388ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveBits (cyclomatic 23, cognitive 28): deriveBits has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c7f9fbf4120f01f19bd08c3514bdf93bb7fdd18b7c2077d617992e8170f09c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importKey (cyclomatic 23, cognitive 26): importKey has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a96c7f17f104614f27749b5d877858b75408a8574f263e044bd5c4f2e17b04f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _rearm (cyclomatic 23, cognitive 24): _rearm has cyclomatic complexity 23 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":"crates/celld/js/harness.js"},"region":{"startLine":6519}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c84d501a10d0f553b771ab0c17db610edd6743805516557da8ce361995a550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createInvalidArgType (cyclomatic 22, cognitive 38): createInvalidArgType has cyclomatic complexity 22 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f369ef792699b238657070c7263e4d50a2317c874b9a09c8f978e693edded4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMimeParams (cyclomatic 22, cognitive 32): parseMimeParams has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed76c4cd043ea8aa1b3eeea32279df16d39670b991acafa034c06bb7639db4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 22, cognitive 22): project has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcb94a37ddc7fc592e4dbf493714cf4488e7270b833883eda8455c8dfdd213f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEnv (cyclomatic 21, cognitive 73): parseEnv has cyclomatic complexity 21 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c431277a1d4d450632f56d35cced4524e0bb6102253124a78e917b22009e137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __encodeStr (cyclomatic 21, cognitive 37): __encodeStr has cyclomatic complexity 21 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":"crates/celld/js/node_buffer.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a3ba4cee899375279283e07a711d97a957621ef077c1531cf32ef31a3e8fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 21, cognitive 29): parse has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a80836b0aca716ddafacb45b2396437dc0da1e96478cc67b9aa168d63147c16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getConstructorName (cyclomatic 21, cognitive 29): getConstructorName has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867e26f4af03195a693e516098f2d94f9c5d1fcc53e67fe1e1f34f7e511531e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __bufSearch (cyclomatic 21, cognitive 25): __bufSearch has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2aa61034e10a7e4a7da453a93f1467dad25fb216ecab1267461675efbe92e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 22): constructor has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4746784fbd44cf54c662c84c4a37ebef0b59ab44f03d0a8d7354724f2ec52772"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeString (cyclomatic 20, cognitive 48): normalizeString has cyclomatic complexity 20 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b1672fd8dffaeb5fa4a8951c4f0fff38307630f8893d8a113bb46bb4a02c77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basename (cyclomatic 20, cognitive 46): basename has cyclomatic complexity 20 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e845d33228f430a1bcd137b74a81e6880505f9f29cbf52851422dd0873f0f7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapEquiv (cyclomatic 20, cognitive 40): mapEquiv has cyclomatic complexity 20 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"575160b3d12d20c2481e5ccdbe980123afe30dd1a75d4a4ae8d08e9f89b4c326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 20, cognitive 31): write has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9a6cbe6487eb5800ca7ea5bf84392266d91311a2d1f60b98503aeabd32a667"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 20, cognitive 23): exec has cyclomatic complexity 20 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":"crates/celld/js/harness.js"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c008e3716a4181ca399c187eb7de1088e8a7d124c91247e5d84a022c5e4d972"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lift (cyclomatic 20, cognitive 22): lift has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4873}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c833c5e763e48323e2b0abdabf36ee8227e282b3ef974890a37eaa4bc82e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __finishServiceFetch (cyclomatic 20, cognitive 21): __finishServiceFetch has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"27732819f433cdd1638c2328b79a076c37338f18059ea1be66ab874c07dbb649"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 20, cognitive 19): fetch has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08dac06d6075f689e8cbb2bc18f3e201818d5b2972f660708629f16f34d8153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function improveStack (cyclomatic 19, cognitive 24): improveStack has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"525d895cf2e5c65a4003901a04d275be55d7099da83744d62771a8485d764660"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportKey (cyclomatic 19, cognitive 23): exportKey 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":"crates/celld/js/crypto.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c6d2bb508eb542d602996d3d955aa73c6515a7285098c8fcd8c9011ada63c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _drive (cyclomatic 19, cognitive 22): _drive has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceeda6359bfbaa8a3d60f3b94d6f5584de1d642a07dabd3a0ce4ec2af6d1ad0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 21): fetch has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac893df9e0bba0032e97165aa4b08bae427e9c561a7b45aec133e0f8f767c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeInto (cyclomatic 18, cognitive 26): encodeInto has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/text_encoding.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5a098806f92b11fda5fa83a509f1ab9c39c1de4875873c2af0f97f1ff13ab9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __wfStepConfig (cyclomatic 18, cognitive 23): __wfStepConfig has cyclomatic complexity 18 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":"crates/celld/js/harness.js"},"region":{"startLine":8162}}}],"partialFingerprints":{"codehealthFindingId/v1":"18998fab4c95cc8071a3c37d6c4e7a54c39b9c73111edf8046f2e6aa669ce00a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __r2Range (cyclomatic 18, cognitive 22): __r2Range has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"104db8fc972977372a67cfcbedeeb77bf2c296b62abe7f96d2b14b1dbf127482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 18, cognitive 20): fetch has cyclomatic complexity 18 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":"crates/celld/js/harness.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"88939330441633e1b189bd0e6be44618061feb7e9210a2aaffacd6daee399133"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extname (cyclomatic 18, cognitive 20): extname has cyclomatic complexity 18 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":"crates/celld/js/node_path.js"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb2146b3f956ebd61357b1e17fa5b1a4ec7b542df91bcc67b9a4d90209c73a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objEquiv (cyclomatic 17, cognitive 36): objEquiv has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"55472820c4c8824b42485d44a73d3d7bf6efca58b089c069a483c348d04c5095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceToSingleString (cyclomatic 17, cognitive 35): reduceToSingleString has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"499786df89372132833d8f29ce538602f0ed5acce59f9b535b816b1454d55176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addPrototypeProperties (cyclomatic 17, cognitive 31): addPrototypeProperties has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"87683d60bd748a748bc1088980d677c3cbe2e4237123f9b721301e0c3fdf5b02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setEquiv (cyclomatic 17, cognitive 30): setEquiv has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f780a6c47ac78efb5a0c3b4cf1519b270564a225fc3bb8f6abc65009653659"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit (cyclomatic 17, cognitive 25): emit has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0343037f20626c7129647a5b3c18d923a047549444a7b0ae5a4a94d0fe43623d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function styleText (cyclomatic 17, cognitive 22): styleText has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"16764aa3d98ad4079c93c8300098c7071260fe96f4e46df5aba764a32723b893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _connect (cyclomatic 17, cognitive 20): _connect has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/event_source.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a182ca5547ed75001f0f8acd0b0b30e0da8e1005f8b247abe9dd24197c7504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revive (cyclomatic 17, cognitive 19): revive has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ec4dd73f33e36710cd559ac9bff27a494cc760806e05ed63828021d205e544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 17, cognitive 18): inspect has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b3f11bda43e4b17d7ce2668498dd7b5c9d3be3c30cfe1ed3832c14ae8aedd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 17, cognitive 17): list has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0958514e33b3ad429f9478d64b9ef631ec64f96db95297929a720b6c3af8a75d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __readResponse (cyclomatic 17, cognitive 16): __readResponse has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11435}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded2bbcd2bfc28a49507275c1981c24a54863fdafa9bf6dd703e2536fc0c4239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function join (cyclomatic 16, cognitive 28): join has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e31e9ab1e81aed2c56fffadc490e868291568295fd0f633fa75dc626268fcab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 23): constructor has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28c219e027e12c7ead2a240a317bd9d41b53821967459310d71650e48e852d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOwnNonIndexProperties (cyclomatic 16, cognitive 21): getOwnNonIndexProperties has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e96fce21bc00ca2237efa7c8e8f9c014a57cad26e35c7f47b39338a0baed80f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __hrService (cyclomatic 16, cognitive 18): __hrService 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":"crates/celld/js/html_rewriter.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e897376d63d78fafcc1460d1b214843c0ddfb9a55e50407826a010efa495c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transcode (cyclomatic 16, cognitive 18): transcode 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":"crates/celld/js/node_buffer.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab850395ee3bf27dec0ed3a91dcbaa53766c533cdbe205b21f1f60f1ca3727aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __wrapServiceResponse (cyclomatic 16, cognitive 16): __wrapServiceResponse has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"8920344a45a4bdd59100e81a4ae1fb3e093628c49270182a663614d2cc7d15ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addEventListener (cyclomatic 16, cognitive 16): addEventListener has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9733}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a460d498675983c1f2c9dc837aa50820e7005ee41f69ea695e15a7fb17a7f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function byteLength (cyclomatic 16, cognitive 12): byteLength 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":"crates/celld/js/node_buffer.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5d3a92c3207f8cc96cb8f3ed9851cea651d4213a78a089fd998c81715fe83a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 32): constructor has cyclomatic complexity 15 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":"crates/celld/js/url_search_params.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996382bca5d51c5515aface511a2aeb6ffb1618aa8edbfd8869e9e494b86168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":8904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dff28e6cb116db29a9b04ff05e5677b15ffbf2233e50521d766a3d45dc25f79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __rpcWalk (cyclomatic 15, cognitive 25): __rpcWalk has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02ce5d60e3a090433406131879d873f30a7dc16aa947e5af6c6db872673c62e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 15, cognitive 25): inspect has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"da46d804d1cf9dbb61b684ac2106098b31d857427f0b2be1855b88787fe87b80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeListener (cyclomatic 15, cognitive 23): removeListener has cyclomatic complexity 15 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":"crates/celld/js/node_events.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e95aa4404e606d984895aade6716ac220da5cdabcc0a292c731603b867e450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enqueue (cyclomatic 15, cognitive 20): enqueue has cyclomatic complexity 15 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":"crates/celld/js/byte_streams.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41a92eda16301c871c73267fc5ca28bf6734280669c00cae800938f57894a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatError (cyclomatic 15, cognitive 19): formatError 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":"crates/celld/js/node_util.js"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d4f42f59f5325ffe4c92f53f863b9f79c802f464447cf698a479ebcf014dfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extname (cyclomatic 15, cognitive 18): extname has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df516d77ca369d38891505844300071cddb9f5347212949737d7f3af7f242a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFunctionBase (cyclomatic 15, cognitive 17): getFunctionBase has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1705253f8401716c7a760a616b9618d73454e3c1acddeaa2216c1b54f7d78973"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pipeTo (cyclomatic 15, cognitive 16): pipeTo has cyclomatic complexity 15 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":"crates/celld/js/streams.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd710bbbc05ce55132407c3c86f30e6cdeea3406cb884d738187879a1b3938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isZeroWidthCodePoint (cyclomatic 15, cognitive 14): isZeroWidthCodePoint has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a15230dac3716943d83da206fd6033c0c1001cd2f5163e605eebaeabdade260"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __retireInputGateContext (cyclomatic 14, cognitive 28): __retireInputGateContext has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af88b2d1ef7b889ecdb7a3be8c109ca06b44c6a0c649d842fdc1a5248656a82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matches (cyclomatic 14, cognitive 23): matches has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_assert.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cfb2a5d266598fc20acdc71268cff4ed7f9431589f9ea5992895d0ba5a79a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 14, cognitive 19): send has cyclomatic complexity 14 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":"crates/celld/js/harness.js"},"region":{"startLine":10569}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb868e776f01bf0a5292ba6bd158e4bd1db82183e847011b11756433a3e84b48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sign (cyclomatic 14, cognitive 16): sign has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f71f06c2c8d36e13e21337e02a8b1290590eeb3930d7d66d65730cf8662ae1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 14, cognitive 15): inspect has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c5fa7817db9431003b419ee464307ee13072f6a269e0f8dc1bc3a941b40817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __r2OnlyIf (cyclomatic 14, cognitive 14): __r2OnlyIf has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a57592ed8526034aee88ccf301d260a3e76920d1d31cca9639a98e1426292"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doFetch (cyclomatic 14, cognitive 12): doFetch has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5191}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a5412c260283466f4b1a1d6fcedece9eba70e0553f2d83ffcbbf7d1cb471f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 13, cognitive 24): start has cyclomatic complexity 13 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":"crates/celld/js/harness.js"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eed83fc180b165e4494c556912b7170ca8029993ac3e31662ed901318dc883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 21): constructor has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/headers.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58d369bdbdc5533ba3e8b6a364f94f89f3e59f6f0507a53bcf6483efb834d5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 13, cognitive 18): encode 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":"crates/celld/js/text_encoding.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e4c690d0e34c41f372b00c354e90b002ff355ad0c84f36465dc418d68798a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredClone (cyclomatic 13, cognitive 17): structuredClone has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10858}}}],"partialFingerprints":{"codehealthFindingId/v1":"327a893ad60596fa11f6c433f16109707b8ee9b3d5d55559616c7a871f58345f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transaction (cyclomatic 13, cognitive 16): transaction 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":"crates/celld/js/harness.js"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bc0bde10d68ace15326946486b1818ef153c87baffc825a917e8c0fdfd2a38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateNumber (cyclomatic 13, cognitive 15): validateNumber has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8838d4d49e7456634767f8e556be5c70672db82aa3d7ef3cfe096e6ccaaef170"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 13, cognitive 14): verify has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4572d49d5d10eefa430614926a55db69cae1794660a4f3568646692903a33565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __r2WriteOptions (cyclomatic 13, cognitive 14): __r2WriteOptions has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d74aae5fe2693d3984a7c8735faeb900e059c2a0e48a87a25ef0af66ebe71c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _aes (cyclomatic 13, cognitive 13): _aes has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7da91092060138e9f9dfaaec76b1d682d1a498155c41b146965a21a329b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 13, cognitive 13): fetch has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":7458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118622b70053d1f907603c56ce81320ed0c587f5c5d4ec6a7b37849a52cdd09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copy (cyclomatic 13, cognitive 12): copy has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acc239d8ea2736d8020929a086e04f66f677b5fca90f238064ff1205c35044b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 13, cognitive 11): read has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"84955911f69b06e58158f04e39634369a99017aeeb62f73c099257d343b9f4ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 13, cognitive 11): close has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":10598}}}],"partialFingerprints":{"codehealthFindingId/v1":"086083ec35f08e396d19ba2e1a10ee7589bc37e35bc3a2f669d98e6ff84c61e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57fae531c27b817783997e2998a0244d3ee1de278f4972d36da7b5a85b10ab3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSpecialArray (cyclomatic 12, cognitive 22): formatSpecialArray has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d30b994b42a0e93ab1ae1ee64e630634be6d23f322128330a1f2371c5e2f448"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeAllListeners (cyclomatic 12, cognitive 19): removeAllListeners has cyclomatic complexity 12 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":"crates/celld/js/node_events.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa0e18e18a68f210d6b41a2c23a1392ede6dea46cb197e5d56ebb2bdbf8328"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __d1BindValue (cyclomatic 12, cognitive 17): __d1BindValue has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":7719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9297c72ad8734c3eea33cc34fb9c70914534421b66659fd097bfc99dec2946"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateObject (cyclomatic 12, cognitive 17): validateObject has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4518e2ecda9c9609a5483357f3bc974988e59f73b0c5d17407494a1735b9c60d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteBatch (cyclomatic 12, cognitive 15): deleteBatch has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f43fc10bc37ae487a9af8c4901692b5d85bc2127ffe3592b30f082c3bf0a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchEvent (cyclomatic 12, cognitive 14): dispatchEvent has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9770}}}],"partialFingerprints":{"codehealthFindingId/v1":"560d87efb4d0e0b146306815b979cbb14012b9f188a212026a23c1737922578d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatPrimitive (cyclomatic 12, cognitive 14): formatPrimitive has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa47182d48c204211cb00e2ac7fb8e273cc53282c42d8eb0f7d09bd4bc8b7a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alarm (cyclomatic 12, cognitive 13): alarm has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9005}}}],"partialFingerprints":{"codehealthFindingId/v1":"80589bf398ed062618d774c8494562230d7c73dd597759d94b665b9f2a9c5a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 13): constructor has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":9951}}}],"partialFingerprints":{"codehealthFindingId/v1":"56972213bcceb2555687cb9fe712c86b6b2600df14accef5bffaababa4a1baea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __decodeStr (cyclomatic 12, cognitive 13): __decodeStr has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e63e4b91e1109f54a4a67b08313dcab34d7753c56dcfcf43ba67d18abc78ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isArrayIndex (cyclomatic 12, cognitive 13): isArrayIndex has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077e2370c871459736a988a305b44a30bb961fc6560d43b883e76e88070ffd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __iterableBody (cyclomatic 12, cognitive 12): __iterableBody has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df0467ccb9d54fc0fabb360ac8c6593be99f0cc5329e984f9136d41630c66f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revive (cyclomatic 12, cognitive 12): revive has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4940}}}],"partialFingerprints":{"codehealthFindingId/v1":"c105e1085b22c145ab5a6dfee2218f7d656efbf47908fb3c10cc3259167fa9ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRandomValues (cyclomatic 12, cognitive 11): getRandomValues 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":"crates/celld/js/crypto.js"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c24e8baf6e5aa299c54ce825ddab4ab9fe3cbe14c872c82a14b25f5642943cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __wfRestartOptions (cyclomatic 12, cognitive 11): __wfRestartOptions 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":"crates/celld/js/harness.js"},"region":{"startLine":8129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc4a3799887019db8721277bc3c4c05eb9c357eb8dfe246627c36ed8b5cabe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _uspDecode (cyclomatic 12, cognitive 11): _uspDecode 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":"crates/celld/js/url_search_params.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec2eaca2969815c5262c2207b38b64ec1a58029650dc01a779b4a3aadeffaf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _rearm (cyclomatic 12, cognitive 10): _rearm has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9252ac8722f664ea6a6cd797e1f8bb340c231fc425516c3759b0297b3eefe18a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __walkLocal (cyclomatic 11, cognitive 17): __walkLocal has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":4682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f98c036e253b425c7f09219e342e093e4978dfba38b2184747005c4695a12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addListener_ (cyclomatic 11, cognitive 17): addListener_ has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7994e1d4d80d951293328740b391964afdeaae374b922093a7d1683f9f4126ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAddress (cyclomatic 11, cognitive 16): parseAddress 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":"crates/celld/js/sockets.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be66afe6351143e4c8d7a201ae0ed7670db6bfeae3b3c3da9d1da558cdf84c16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 16): constructor 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":"crates/celld/js/writable_stream.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"073dacefab51af201379d1932fd36fd84a44d26186a620329b28c3a646ee1640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alarm (cyclomatic 11, cognitive 15): alarm has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7457d97741abba9d5a25b33622cccde595ebc73ce4060cdcc71c6161d2e1df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40fa95dfece2e46da6d542b701586c27e0c77bde8136d312a8adebe646b0cd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __fsPath (cyclomatic 11, cognitive 14): __fsPath has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a10abe4e543596e94f429f8f25d4d83c2276e7c3f420d0f5c57b94b7ed7342f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _feedLine (cyclomatic 11, cognitive 13): _feedLine has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/event_source.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bd7532ec3f4c1d7c9a83c95622a5bc425018229124e76ea90fb391978f7169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkValue (cyclomatic 11, cognitive 13): checkValue has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6732f4b91507893a5bd9f96be11589ed413ead923212a5610b4c52bae9ddb0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBoxedBase (cyclomatic 11, cognitive 13): getBoxedBase has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe3f2adac90fb30006d0d68166e89c0bd79a0ef4c81c0ff8660b0f32159c1bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendBatch (cyclomatic 11, cognitive 12): sendBatch 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":"crates/celld/js/harness.js"},"region":{"startLine":7542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52d5652d7ca8bec3f9cd8e1e75ac9487d4f1de0154ef303eb0894c970dbb4d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toNamespacedPath (cyclomatic 11, cognitive 12): toNamespacedPath 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":"crates/celld/js/node_path.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e0b3d36ae0ba3c40758c84a031d88edbf9639621d0e642542bca63c2f3a5fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _leaseBatch (cyclomatic 11, cognitive 11): _leaseBatch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":6800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8487ee1c9e97c54d56560f18941ea8b12e1aa1fa97d84114566d8abf78cb5e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __r2Value (cyclomatic 11, cognitive 10): __r2Value has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0325484c15014ac6a0dbeb3161e89503d6e5f65530fdcad25b04b97a01198e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function specialize (cyclomatic 11, cognitive 10): specialize has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a61f4fd6b7d5e907cb5dba74fe25d77a37d50bd528f8da3d1d8e2cc393b120"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __queueEncode (cyclomatic 11, cognitive 10): __queueEncode has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":6137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b93d3271aa5fdc7e08d3efcfae3075374ffaf50ee7989d50fd35ce9d52f5ad2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areEqualBoxedPrimitives (cyclomatic 11, cognitive 10): areEqualBoxedPrimitives has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad9ad1ad46a950535765cd7cdee94d09af6b2f1ec4e178c5c05af058d377feb"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/harness.js: 11411 lines of code: crates/celld/js/harness.js has 11411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67ee595e8b0b6f1652448233af02415c331b25f39c7b0f6302f7a634d6987e"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/node_util.js: 4589 lines of code: crates/celld/js/node_util.js has 4589 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9a6d3457484826f94bab3bea67ae0b1fdacbf012ab387ae342c38ea6c90477"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/node_path.js: 1106 lines of code: crates/celld/js/node_path.js has 1106 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_path.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e428ad80ad7dcc4a3d0554ef1a520264ddf71671f7ba38ef81373516efbf36"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/services/kv.js: 1076 lines of code: crates/celld/js/services/kv.js has 1076 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/services/kv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30720611268d952e7f18358ccaa6379d5e07c010d7b804d8cce2c9e9ea5cc88e"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/crypto.js: 833 lines of code: crates/celld/js/crypto.js has 833 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b780ed02d9d942d8729c2bed733a4a1bb096567302884873d1e20cbd73bad89b"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/streams.js: 818 lines of code: crates/celld/js/streams.js has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b71fa79961163e11a8c26a35a530af78dc9789b6440d592949f225cc071fa3"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/node_buffer.js: 798 lines of code: crates/celld/js/node_buffer.js has 798 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"599fe603a9bc564cd07354ccb62cb6e8c5d362f814236cf7cf8c1b073677891c"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/writable_stream.js: 671 lines of code: crates/celld/js/writable_stream.js has 671 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/writable_stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f520876afb9948939ebd5aa6e821628047293a010da3a6821890b4f6638d2dcd"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/byte_streams.js: 652 lines of code: crates/celld/js/byte_streams.js has 652 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41ab19ce76cd465e0f3147f2a7625a3bec2c812eb4f533086bc8a4dcf508e10"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/node_events.js: 560 lines of code: crates/celld/js/node_events.js has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_events.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f80beaf397ae2b9198588c841102c5c18aac81cb9d29b03050085fee1b1ce"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/celld/js/html_rewriter.js: 477 lines of code: crates/celld/js/html_rewriter.js has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/html_rewriter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"585094fdee6116593c302100f3b7d452183a7213047d194044db27cf98419199"}},{"ruleId":"R4","level":"warning","message":{"text":"Test Coverage: 0% of 34 production file(s) reachable from 0 test file(s) via the import graph \u2014 \u0027production\u0027 here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace\u0027s file count"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"64e0e3511eb969fb4720b196e7d3799e1714077217351c3c56a27b50e3e21220"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"39adcedd6c24e02f9e594b9032ad2bf8424f84f548f2e81186469d5cd639782e"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/crypto.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f69e265b33d00970aa1b974b33cc358630a5cd8a515af2063646f39190d812"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/ws_client.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8900bd3f3e44df63b546e7e810dca18a75a86b1f9bdb45a8ca7dbd4f7000fcc7"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060_headers\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/static-assets/public/_headers"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600c672ddc69704d222916b6c8564c992b3888b80be0aef3874286869733264"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/container/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/container/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8556fd11ed88d189ea69e8e693fc58767eeeb450f3adf99be6a4ef8e25ed2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/opencode/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/opencode/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"04768b0797bb0de761b80c841745a2a1c3b6827255fd266afe792e4bd1a251c1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/pi/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pi/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a419eca6002a938190fc9bf6eaae2b0869380dc40e54b1b583e16f27dabda8b2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/sandbox/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sandbox/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d82f9dfc2de6a571bc785ec763cb7cf4abf09e2acfe38d89e8a0e195ef29f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(chunk instanceof ArrayBuffer) \u0026\u0026 !ArrayBuffer.isView(chunk)\u0060 appears character-identically in 2 files \u2014 crates/celld/js/harness.js, crates/celld/js/text_encoding_streams.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6491d9c7d7e9d101df993a0796deed101522082ddf95d645f9584b313315895"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options !== undefined \u0026\u0026 options !== null\u0060 appears character-identically in 2 files \u2014 crates/celld/js/node_async_hooks.js, crates/celld/js/streams.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_async_hooks.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f348107f7de6a79c3d9cff48fa65388cca646be57ab7756554e2466516e7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options !== undefined \u0026\u0026 options !== null \u0026\u0026 options.mode !== undefined\u0060 appears character-identically in 3 files \u2014 crates/celld/js/byte_streams.js, crates/celld/js/harness.js, crates/celld/js/identity_transform_stream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/byte_streams.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf4452bedb9a8ce1122ccf0f295231711a96d7175f412dbde9d3a60a65771f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options === null || options === undefined\u0060 appears character-identically in 2 files \u2014 crates/celld/js/harness.js, crates/celld/js/services/kv.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"df600683d3553f0b0b7ab8d11b5fc7d68385e9b0d71758c5bd132abe121bb602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options === null || typeof options !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 crates/celld/js/harness.js, crates/celld/js/node_events.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":11095}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d7cf1acfba749ed2c7cf3882c720dedf91b96db2a04c20649fce54b17a2396"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 crates/celld/js/node_buffer.js, crates/celld/js/node_os.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/node_buffer.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d223a7e77b654e7235be1ac0f8dbd503196bcac6e49d49014fa8991807dc0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060advertise.is_public_ip() \u0026\u0026 !unsafe_public_advertise\u0060 appears character-identically in 2 files \u2014 crates/celld/fleet.rs, crates/celld/operator_cell.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/fleet.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6564834d3d109f09860a0c4c23fa03a79c0a295c4d7a49f663ca0c81892cbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/celld/assets.rs, crates/celld/dev.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/assets.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a287956483abcaebead4cb2e3f944f040d098f05d322291fc9d218074d75db6"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 2/4 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: _connect: \u0060_connect\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/event_source.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0190dc74e17bb8e3383436627a3a2b7ac7a6587983696e2718250019b161d6b3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetch: \u0060fetch\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/harness.js"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f56c2daf7e16c42473fc4c8de2247684dcc0548e0a5c1024c658724ff4068d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 10070 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js.rs"},"region":{"startLine":10070}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b84d31a95e985f70247cbdf8b35e5c486d465a0445fa34b26b2e75d27a1ffce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/startup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1346e877e3eef57a8993da9336c7207b533e2f9dcf844fb2ebc2a172984059c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060snapshot\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022error\\\u0022:\\\u0022actor_stopped\\\u0022}\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/actor.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f03ea198b599ff830d8db0e8cfddfd09dce6fc67e824b511d6214adb1f6c907"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build\u0060 turns every \u0060Err\u0060 into \u0060\u0022linux/amd64\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0642a262a4c665d83f5e3d95089204b37acb4ad8e26d55a40f0f76898d81e46"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060engine_cli\u0060 turns every \u0060Err\u0060 into \u0060\u0022docker\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/deploy.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc256001f249ff4c46f95d27b2f50bb056a3abc7b09c1cab2548299dd8c06f43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060allocator_slack_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/memory.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc9952558ca6a8977675cf03d99569a23776026a12dbe703cecb3a6c6f8d66c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060origin\u0060 swallows every exception into \u0060return \u0027null\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/celld/js/url.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6654280f970b7f57d3450789d875e025be2cb8816fd6e207394eba3949d7e7"}}],"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-1164","guid":"793ece19-b164-f952-a8b3-33dc3b591809","name":"CWE-1164","shortDescription":{"text":"CWE-1164"},"helpUri":"https://cwe.mitre.org/data/definitions/1164.html"},{"id":"CWE-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-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":46,"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."]}]}