{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"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":"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":"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":"ioredis-client.createIORedisClient (cyclomatic 42): ioredis-client.createIORedisClient has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 15 of the 42 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 220, 136, 193, \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":"src/classes/ioredis-client.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac563b6a88663acff0e1b589877b4b1e4f2a4074a646478df4368d1d4039916"}},{"ruleId":"D1","level":"warning","message":{"text":"JobScheduler.upsertJobScheduler (cyclomatic 36): JobScheduler.upsertJobScheduler has cyclomatic complexity 36 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 13 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/job-scheduler.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a85a790bf86a9ff8f984afa12c9fdf4fe983700d57cb98e4f93c7bf7cd56ee"}},{"ruleId":"D1","level":"warning","message":{"text":"JobScheduler.upsertJobScheduler (cyclomatic 32): JobScheduler.upsertJobScheduler has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/job_scheduler.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62063bb06bdb5853336107809ccd7660b5397958d58152d81e52c9af498a9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.ParseOpts (cyclomatic 26): Job.ParseOpts 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":"dotnet/src/BullMQ/Job.cs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d369680a778e2e4d1425f14041bb6020a28b98d06c964d6216ba6a984d31e2e3"}},{"ruleId":"D1","level":"warning","message":{"text":"sandbox.sandbox.process (cyclomatic 24): sandbox.sandbox.process has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 35, 22, 137). 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":"src/classes/sandbox.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd176863356f866e34e231d9665136a36c6205ae6515ebefea4ee53fae217870"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker.constructor (cyclomatic 24): Worker.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":"src/classes/worker.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"603b7d2bcbd5534dcd59713ce0d4984c87e9e1fc385973db66b1ff0686277349"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.ParseRepeat (cyclomatic 23): Job.ParseRepeat has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Job.cs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d463889961ecbb0df9898981074e51ea7485c5ce4ac4f26d5dee179d3c30fd"}},{"ruleId":"D1","level":"warning","message":{"text":"JobScheduler.UpsertJobSchedulerAsync (cyclomatic 21): JobScheduler.UpsertJobSchedulerAsync 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":"dotnet/src/BullMQ/JobScheduler.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e8080cd1f34972b67bc12159dd2be53f75fdd4cd6707e0e9ecc56c8d3c7f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Queue::upsert_job_scheduler (cyclomatic 21): Queue::upsert_job_scheduler 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":"rust/src/queue.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda399a96dd54f046275a1c2332118372e9e00765bf2068e38486bd9d2979678"}},{"ruleId":"D1","level":"warning","message":{"text":"bullmq_official::flow_producer::merge_job_options (cyclomatic 21): bullmq_official::flow_producer::merge_job_options 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":"rust/src/flow_producer.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c9a38dc41077d683f8c12d35535305eeef44f1fe895e385398bdf2fc82c838"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisQueueBackend.getDependencies (cyclomatic 21): RedisQueueBackend.getDependencies has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da722928a81c8d73606afc53bc52e5aac43b53ed9f72ddef5e37e5a225b249a"}},{"ruleId":"D1","level":"warning","message":{"text":"BunRedisAdapter.connect (cyclomatic 20): BunRedisAdapter.connect has cyclomatic complexity 20 (threshold 15). 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, 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":"src/classes/bun-redis-client.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e82b3a821e4c02fb599a2aaf6cd4dae8e9ba648419b02eb920d935107e652a"}},{"ruleId":"D1","level":"warning","message":{"text":"job_scheduler._transform_scheduler_data (cyclomatic 19): job_scheduler._transform_scheduler_data has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/job_scheduler.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c927dcf8d2de9f69a7e79d7374e9a72a5100882eaf3348bad392c96ef24c6c18"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker.run (cyclomatic 19): Worker.run 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":"python/bullmq/worker.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9dad0d08b9fd0d019ea2a918c1ad7367d3c380c249ccce4f40410d3422dea7"}},{"ruleId":"D1","level":"warning","message":{"text":"Queue::get_jobs (cyclomatic 19): Queue::get_jobs 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":"rust/src/queue.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea9f99dcc6f5fb40093ef26a1c159e06083443aa703e343bf3ad28444d82a19"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptLoader.resolveDependencies (cyclomatic 19): ScriptLoader.resolveDependencies has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/script-loader.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d64c362728d374b9f74b6b2149a816278622340986cce7409baffa02e4360"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.validateOptions (cyclomatic 19): Job.validateOptions 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":"src/classes/job.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"36221a31fcffb0d2e6b7ed5874562ceb0974bae3b5700b4b8061ab2b32d85a66"}},{"ruleId":"D1","level":"warning","message":{"text":"ValkeyGlideAdapter.execQueuedCommands (cyclomatic 19): ValkeyGlideAdapter.execQueuedCommands has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1139, 1164, 1199, \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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a48516c3cb950f3f2e32bc395434aedf8d3fb52a485bd60e2a5e74cb8095d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker.mainLoop (cyclomatic 19): Worker.mainLoop 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":"src/classes/worker.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4e5af772533742428a86fa9d989f58df2707d3067154b14cd118bf34d415d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker.handle_job_completion (cyclomatic 18): Worker.handle_job_completion has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7da4ce72f5736ec5a3384e5a014f6d4b983ba881162865a045331bfa0ffd1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::pack_update_scheduler_opts (cyclomatic 18): Worker::pack_update_scheduler_opts 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":"rust/src/worker.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7382ec25cd3665b707d768da58dfba29c145125d1916f76abb36ffd4b2df2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisConnection.getRedisVersionAndType (cyclomatic 18): RedisConnection.getRedisVersionAndType 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":"src/classes/redis-connection.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1a4a3ec04ddaa2deed74168c38d505d4cd1c3c63051efaab7311aa69237776"}},{"ruleId":"D1","level":"warning","message":{"text":"JobScheduler.transform_scheduler_data (cyclomatic 17): JobScheduler.transform_scheduler_data 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":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00c0d54a8d12a5479214e932165d371fe125165e4a1927873685843be593133"}},{"ruleId":"D1","level":"warning","message":{"text":"Scripts.build_parent_obj (cyclomatic 17): Scripts.build_parent_obj has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5074542d9394e0b4ca546d950dc0ee20a9de5210dc64a2afbb7f42cb1221710"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.fromRaw (cyclomatic 17): Job.fromRaw 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":"php/src/Job.php"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d079e4ac0dc440bce171801bc6b37da74f5abc6d1b33017c26e9a280ca37c"}},{"ruleId":"D1","level":"warning","message":{"text":"JobOptions.fromArray (cyclomatic 17): JobOptions.fromArray 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":"php/src/JobOptions.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85fb502b0ac5985e10e49126503c665dec09a31d8960b6e9ec8a8f92dfd6c11"}},{"ruleId":"D1","level":"warning","message":{"text":"Queue::clean (cyclomatic 17): Queue::clean 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":"rust/src/queue.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db85369f4327f236d054c3a11e3db4570938a6e55170b8cf8f69b0c21f4bf9d"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgresQueueBackend.getDependencies (cyclomatic 17): PostgresQueueBackend.getDependencies has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd32b0bd313a88290e3ece156b7c512ea7620743b3c53575492b1d48c87878b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Scripts.get_deduplication_opts (cyclomatic 16): Scripts.get_deduplication_opts 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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6806f5e77e051ecc87ab05d5490737ed25a351be14a299ea0f5dc617eaa9670"}},{"ruleId":"D1","level":"warning","message":{"text":"bullmq_official::job_scheduler::pack_delayed_job_opts (cyclomatic 16): bullmq_official::job_scheduler::pack_delayed_job_opts 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":"rust/src/job_scheduler.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1ea7d78a0e9d41113f37555ef29a8b5e5b078ff7bd8136055de1415b017b7"}},{"ruleId":"D2","level":"warning","message":{"text":"JobScheduler.upsertJobScheduler (cognitive 54): JobScheduler.upsertJobScheduler has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 7 (17 pts), boolean chains 12 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 32 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":"src/classes/job-scheduler.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce260551e1acf43650c79262d703dcd5354d869f767f126eb844d0fbf64cca"}},{"ruleId":"D2","level":"warning","message":{"text":"job_scheduler._transform_scheduler_data (cognitive 45): job_scheduler._transform_scheduler_data has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (31 pts), error handling 2 (8 pts), ternaries 1 (5 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":"python/bullmq/job_scheduler.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07f8d7cff10ed05dfa12467cc6db2345ffc10974523f78cc48f9bd5caa1a4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.constructor (cognitive 40): Worker.constructor has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, ternaries 2 (7 pts), error handling 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"633da423a81410a9948cf290e7aa838c96b42b37c7c3a7f81c4a0a3af33dacb7"}},{"ruleId":"D2","level":"warning","message":{"text":"ValkeyGlideAdapter.execQueuedCommands (cognitive 39): ValkeyGlideAdapter.execQueuedCommands has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (7 pts), error handling 3 (6 pts), loops 2 (4 pts) (nesting depth added 20). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 1139, 1164, 1199, \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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8899aaca5a6cf98abe8f3982483892192146eb05f581904cb209760c7eae29"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptLoader.resolveDependencies (cognitive 38): ScriptLoader.resolveDependencies has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 1 (4 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 16). Of this number, 34 points are the body\u0027s own statements and 4 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":"src/commands/script-loader.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdece92f86b35f550fca59c801275de4fb20f9e1856eccd6628b1630397edc0"}},{"ruleId":"D2","level":"warning","message":{"text":"JobScheduler.upsertJobScheduler (cognitive 36): JobScheduler.upsertJobScheduler has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 13, error handling 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/job_scheduler.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed2ec844b08a4e0f9b60e629ae8b2cfcc199c9213e890b94146bf807ecaef1"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.retryIfFailed (cognitive 36): Worker.retryIfFailed has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (30 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0277b7333564f0da86d2b93ccc66fee637f5b38da66db287d91d861862ad209f"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisQueueBackend.getDependencies (cognitive 35): RedisQueueBackend.getDependencies has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 4 (8 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). Of this number, 19 points are the body\u0027s own statements and 16 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281e0e806ef0a404fd4df21e0e35dec14220c1dad6b17a2d7ce0000c7f46902"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::parse_move_to_active_result (cognitive 34): Worker::parse_move_to_active_result has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8f8fa2c2e19be77b0962039dfbfb670d38df158cf7117ad8b17c4b83ce853a"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.retryIfFailed (cognitive 33): Worker.retryIfFailed has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/worker.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"551122f3937f2f54a22adb59ae8640236eb25a3f7c86462953ec51e9705796a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisConnection.getRedisVersionAndType (cognitive 33): RedisConnection.getRedisVersionAndType has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c2837c6dab5e4e26af44fef32c2388400ed18120ccbb0ac96543a606b62957"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.ParseOpts (cognitive 32): Job.ParseOpts has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Job.cs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc5eddf994037c2d06566a628161df9c9a56ce3b8e16d8123cac1948516fdc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::get_jobs (cognitive 31): Queue::get_jobs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"53077427c013d602bbd8396dea6f0b9fb1fd3353ff46bcf782f5e4edea800f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"JobScheduler.transform_scheduler_data (cognitive 30): JobScheduler.transform_scheduler_data has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16, match/switch 12 (14 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":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c42a791d007260b0a34b849b035e65c16fde33fd81aea334a237d661dd56b"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisQueueBackend.removeOrphanedJobs (cognitive 29): RedisQueueBackend.removeOrphanedJobs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"041042bc885bb992a7194918b7d2b5ae017896de769f855a86123aae9f17c96d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scripts.get_deduplication_opts (cognitive 28): Scripts.get_deduplication_opts has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 8 (9 pts), boolean chains 6 (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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab5b93f8faed7337150a2f52326a5448cadb396ab18ae93621815836d0a820d"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresBackend.waitForJob (cognitive 28): PostgresBackend.waitForJob has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 pts), error handling 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":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f64ff645f5871cfd66fd4cc780d5fa34a76e83af47337a2fe800017b37dc04"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.run (cognitive 28): Worker.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 3 (5 pts), error handling 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/worker.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a2eb5791793f5b284dbecd1978931add94b6dfd22e31430a6d50e878789020"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::update_job_scheduler (cognitive 28): Worker::update_job_scheduler has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5256067a34bb3b5e5f666e55f66feb6b566d3e8aae2f89dbbc9b82d9ade2a9fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::pack_update_scheduler_opts (cognitive 27): Worker::pack_update_scheduler_opts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 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":"rust/src/worker.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445f5d633c601a01f3d3dc6d104c888d4a8fc15f1b70e3e03b04cb365a7596c"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.waitForJob (cognitive 27): Worker.waitForJob has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cddbc32f19f76d2b73055d9c14050478b711fbb1957b02b4176952d00c64b3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueEvents::consume (cognitive 25): QueueEvents::consume has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 2 (8 pts), loops 3 (8 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue_events.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"31de2619ff8baec095d556b2ef0c08965bb9726f56836e227ea41682ea70886c"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.validateOptions (cognitive 25): Job.validateOptions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/job.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f262282baef705a1f213dddd9433f44a8230944c9dd13dc7b7754f4e3cb61e"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue.get_jobs (cognitive 24): Queue.get_jobs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (11 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":"elixir/lib/bullmq/queue.ex"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a54d537c1e751fc43ffbcccf29ae242113c2b52ff0d24d1fae450ddc46f108"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::upsert_job_scheduler (cognitive 24): Queue::upsert_job_scheduler has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab9aa17566404db66579953b7aaaaf538ebe66f7a30730ccd4814bd79987f4"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRedisAdapter.runCommand (cognitive 24): NodeRedisAdapter.runCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 11). Of this number, 21 points are the body\u0027s own statements and 3 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":"src/classes/node-redis-client.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc902a6ab39cdf76d443bf2c4fae3eae1ffb6a7539bb6550aafa74f6ffd6cb40"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.mainLoop (cognitive 24): Worker.mainLoop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd90538e0fea4f129e8a834b556cb5cd3059d7045509915d29a5bfe6ffeb8bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue._parse_client_list (cognitive 23): Queue._parse_client_list has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/queue.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf33c1ec4f69e92974366e786638ff3dce3ddfff54466b0c5c6a14065fd633f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowProducer::pack_add_args (cognitive 23): FlowProducer::pack_add_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (23 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"358a8e68b3172589a857ea36dce4e166415304cb98ff838afac5d101fada7b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::get_ranges (cognitive 23): Queue::get_ranges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a5f68cabcb069ceddfd99dbc51f93a4b22a16db1aef1017bdf20647970cdc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Relay.readLoop (cognitive 23): Relay.readLoop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/relay.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669addb08942ba85d457e2092c9eacbd38001ec63e08524dd5354abed39c3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.MainLoopAsync (cognitive 22): Worker.MainLoopAsync has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Worker.cs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed49a5d3945f186981e1a3132355ca62558ecf392ce17175b362b9fef786e3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptLoader.loadScripts (cognitive 22): ScriptLoader.loadScripts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/script-loader.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7147884b19603133ce60093c268bfeb55ec90ae89cb9c903543d545e515e40e"}},{"ruleId":"D2","level":"warning","message":{"text":"JobScheduler.transformSchedulerData (cognitive 22): JobScheduler.transformSchedulerData has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"src/classes/job-scheduler.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61a40a577a3b369949e038a178308c128de68b33b041a3b918c1ce73b13a7af"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.ParseRepeat (cognitive 21): Job.ParseRepeat has cognitive complexity 21 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Job.cs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c584c4897ca0c72dcbfb1d03fd92ab4a169205f8c0ddea69d0a04b2f08bc5df"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueEvents.consumeEvents (cognitive 21): QueueEvents.consumeEvents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/queue-events.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c384f9ba6459314efab7d37ca02991ac933abb736ff311ce8f08e7536cfba5"}},{"ruleId":"D2","level":"warning","message":{"text":"JobScheduler.UpsertJobSchedulerAsync (cognitive 20): JobScheduler.UpsertJobSchedulerAsync has cognitive complexity 20 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/JobScheduler.cs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee48132580e67cb1bea811a9142ba6ebb8fff9584c10c5ef8f1fbd60785fe8f"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresBackend.WaitForJobAsync (cognitive 20): PostgresBackend.WaitForJobAsync has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b04e1dd51bc701fd9c89699593502a3d8a78b7401496294ba5b2753eea856"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.pause (cognitive 20): Worker.pause has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (4 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":"python/bullmq/worker.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36be670488e38ee00dafc5dbd5d3be247640e79f6841d1e206c98c484e9155d"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::get_dependencies (cognitive 20): Queue::get_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 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":"rust/src/queue.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee40577f4aca173654bd344c783fa8afbb7dd54e8f2fe02beefb6c1637706ce"}},{"ruleId":"D2","level":"warning","message":{"text":"bullmq_official::flow_producer::merge_job_options (cognitive 20): bullmq_official::flow_producer::merge_job_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0fc256e9445a5c352d0dee1ddbb6fe0d305d59db5d32b653ad334b3441a996"}},{"ruleId":"D2","level":"warning","message":{"text":"OptsCodec.ToStorageMap (cognitive 19): OptsCodec.ToStorageMap has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/OptsCodec.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd340d252ea17e206257cf797ed96253f9c10a4258b5e62cea6c12ffaeaffa"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.handle_call (cognitive 19): Worker.handle_call has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 4, boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c2e6ee41a21648cb7e24afa5c108fe023bc5f438517b0374c9412353b0500e"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.fromRaw (cognitive 19): Job.fromRaw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/src/Job.php"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a717708618a6ff4eb56debfad00964fb766c6b7ba385a586063b973ac6057d50"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::run_main_driver (cognitive 19): Worker::run_main_driver has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4133c7d7666d75b011615a76acf18170da40a71122d0ac08f8b5221f1d31adf"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.nextJobFromJobData (cognitive 19): Worker.nextJobFromJobData has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c726aba433051e8540089caf0cfe25e69f281aeddb47cb5c0141d31d87e55270"}},{"ruleId":"D2","level":"warning","message":{"text":"BunRedisAdapter.connect (cognitive 18): BunRedisAdapter.connect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 3 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":"src/classes/bun-redis-client.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0663a10a383ccc7fd9f37ac093f49bd45efdfcdb04c5cb32043643dbce8c260d"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisConnection.init (cognitive 18): RedisConnection.init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a65880a4686ccac9f06491f847159dee0aa5ab828e2cf5d23f2945ac77d5ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"redis-queue-backend.optsAsJSON (cognitive 18): redis-queue-backend.optsAsJSON has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":3120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ebc2ccc85b70755a34130524b2d595fec7619f1e10c9249c1b5993bc4f5fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenTelemetry.trace (cognitive 17): OpenTelemetry.trace has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 5 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c95900701d9c48eae2e8173bae5032e3c0151cf4173c5f1d7ebdab2b79a4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"LockManager._renewal_loop (cognitive 17): LockManager._renewal_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/lock_manager.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0202ad5a668ffae247c21c8b0dbeef577f7392f00200a5fe51c3bc6d0138ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker._processJobAndFetchNext (cognitive 17): Worker._processJobAndFetchNext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/worker.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2527c202f2e37594027a641781aca8f7a6764ee8dfeea5eff7c9e29b988f1907"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue.getJobsByType (cognitive 17): Queue.getJobsByType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 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":"php/src/Queue.php"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf269c1885f2e3c1862dea0c84196a8e6d714f5774b45edae25a013a030c13f"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::pack_add_args (cognitive 17): Queue::pack_add_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a4d7ec6d3ecaf0d3418d8738a58167b75b89c7107e9a9e2e2f026a9f37911"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::process_fetched_job (cognitive 17): Worker::process_fetched_job has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"8376ad0d9ef0de1e8912de298cbb6c4b8b3b920a58d3484be9cebb4daaa1d9ca"}},{"ruleId":"D2","level":"warning","message":{"text":"BunRedisAdapter.disconnect (cognitive 17): BunRedisAdapter.disconnect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 9). Of this number, 9 points are the body\u0027s own statements and 8 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":"src/classes/bun-redis-client.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe02772685c0d7f36399c8c92c282072d9e36a2f1632582b4ff20810a12a315"}},{"ruleId":"D2","level":"warning","message":{"text":"Scripts.build_parent_obj (cognitive 16): Scripts.build_parent_obj has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 16. 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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ac5a25573a6125846bc5bfe3b83dbd17888c636df7268f1a5ca9b899b3c735"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker.handle_job_completion (cognitive 16): Worker.handle_job_completion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 3 (nesting depth added 3). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6f358509c98b329baada2412c8b22b58bd300c446a22d0d41fd91e6e8fa851"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.__init__ (cognitive 16): Job.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 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":"python/bullmq/job.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb81d0a2b4d9f5d46a4c44ed5d7711eeb791b71763fe5026b65e161739a2deb3"}},{"ruleId":"D2","level":"warning","message":{"text":"JobOptions.fromArray (cognitive 16): JobOptions.fromArray has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/src/JobOptions.php"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380122875166d98a5e5b8b2f06f177b8d969656a9c9c4b303780d99758ba5b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowProducer::pack_job_opts (cognitive 16): FlowProducer::pack_job_opts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecbe28313250e4ee7d0a1706772d370225bb31bf286b8e551a43e252c56b595"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowProducer::apply_pipeline_results (cognitive 16): FlowProducer::apply_pipeline_results has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a47d33035b58988c12176fb4fe78ea588e2f11c262592cc74508b4deeed7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::pack_job_opts (cognitive 16): Queue::pack_job_opts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfa3aea8c8b2d4703ef0636829c0bec86b3e89dd7e893e429da759d600d3a76"}},{"ruleId":"D2","level":"warning","message":{"text":"Queue::clean (cognitive 16): Queue::clean has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 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":"rust/src/queue.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c2a674a3225fdab9cebc82828c89cb14d96ad5dea0969d6531dc46abedf34"}},{"ruleId":"D2","level":"warning","message":{"text":"bullmq_official::job_scheduler::pack_delayed_job_opts (cognitive 16): bullmq_official::job_scheduler::pack_delayed_job_opts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77adfafc980067f6bb5e6434576110af7b068c0bb7112045e7dfcdf7fae55e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresQueueBackend.getDependencies (cognitive 16): PostgresQueueBackend.getDependencies has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 5, match/switch 1 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d944f50f34a62c9b561766af55edfa3124a7de787c833e4c678dd3a227fcda8"}},{"ruleId":"D2","level":"warning","message":{"text":"postgres-queue-backend.mapSchedulerRow (cognitive 16): postgres-queue-backend.mapSchedulerRow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ab641735b8791cdf3c5409cf1e3e426da0e2d85170f5691d2b12e9cf9c35b"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisQueueBackend.paginate (cognitive 16): RedisQueueBackend.paginate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"025e00cb30be45400669d23d0a743e27f1549e8b7c92d4d4bf64447714f3a967"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RedisQueueBackend: ClassTooLong \u2014 1796 significant lines (blank, comment-only and punctuation-only lines excluded), 121 methods. The bar is 400 significant lines; this is 1396 over it, 4.49\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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1f906e61971501644b6b8b1abb3ba6010a79d7a2893ad2c587cad7afcc3702"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Queue: ClassTooLong \u2014 1790 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 98 methods, 2 blocks, lines 71-2900. The bar is 400 significant lines; this is 1390 over it, 4.48\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":"rust/src/queue.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d7f2434b7ba6921d24a5bc302d215d53677e5bba0f76272cbfbf52837e0101"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RedisQueueBackend: TooManyMethods \u2014 121 methods. The bar is 30 methods; this is 91 over it, 4.03\u00D7 the bar. Most of these members implement queue-backend.IQueueBackend (82 of 121 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"31177c9838bfce2383c5ad3d8f974d8fddd7bf0d7919393f0760444c1d5aa8ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/redis-queue-backend.ts: FileTooLong \u2014 1981 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: RedisQueueBackend (124-2982). The bar is 500 significant lines; this is 1481 over it, 3.96\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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1275084bc6ec54efa47709e71ce7610be4c3a9fce250980a70c5005f48e298"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/queue.rs: FileTooLong \u2014 1977 significant 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 91% of them inside a single declaration: Queue (2 blocks, 71-2900). The bar is 500 significant lines; this is 1477 over it, 3.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da40b04f5494f9ef67096f6445de267eff4529498996136ce920618aded64553"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Queue: TooManyMethods \u2014 98 methods. The bar is 30 methods; this is 68 over it, 3.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ef086faf1dda6d000f6f11f61f098a17aac6d8d8d109b4b16533ff4a6d026c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresQueueBackend: ClassTooLong \u2014 1280 significant lines (blank, comment-only and punctuation-only lines excluded), 93 methods. The bar is 400 significant lines; this is 880 over it, 3.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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef5878a6b513a355b4d60bff178d2638d0bb317a146901c6c95c4a69ed403c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/worker.rs: FileTooLong \u2014 1573 significant 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 80% of them inside a single declaration: Worker (3 blocks, 174-2466). The bar is 500 significant lines; this is 1073 over it, 3.15\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":"rust/src/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89eaae9186685b34a055708b23621218c2b97abd2af37391372f50da9b358889"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Worker: ClassTooLong \u2014 1252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 3 blocks, lines 174-2466. The bar is 400 significant lines; this is 852 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a94ad5fdca011d2f14961ac7a01db61d9d6319ebe49e80855236bd4716b6b69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresQueueBackend: TooManyMethods \u2014 93 methods. The bar is 30 methods; this is 63 over it, 3.10\u00D7 the bar. Most of these members implement queue-backend.IQueueBackend (82 of 93 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf4afb153260f0f9fb7aa7d00d2543b353a073c3feea051f1158ba563063055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postgres/postgres-queue-backend.ts: FileTooLong \u2014 1444 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: PostgresQueueBackend (251-2300). The bar is 500 significant lines; this is 944 over it, 2.89\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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4db6b02e060789f795302f84318fb241d5a5fdd3aa3aea25678093a4341470"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RedisBackend: TooManyMethods \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 30 methods; this is 53 over it, 2.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ef8b405e876677b7f19154b99adc73967d08c6caf0ecb1713fd5912c1c914d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresBackend: TooManyMethods \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 30 methods; this is 53 over it, 2.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d44e96a1017b9501a4f3e589abc16f773244ac6a877e272920825d41591bc26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bullmq/scripts.ex: FileTooLong \u2014 1343 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 78 functions. The bar is 500 significant lines; this is 843 over it, 2.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33307947aca207219feb45517526f0b9e73b1c5c0b5d93fce8eddf16976dbd6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Job: ClassTooLong \u2014 965 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 2 blocks, lines 44-1523. The bar is 400 significant lines; this is 565 over it, 2.41\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":"rust/src/job.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf42c953de88e1555bd6151e3c9e6a95b7b70c7069d047d560a8a972affad263"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresBackend: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2a6fb40588b36e3a374962960a0f1f2586bac388482f30b80bb8704bc89055"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Job: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"73204e5e658a157fc305f7687c76a7557a70940eac35fbbf6f7c4924ef2f93da"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Worker: ClassTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 433 over it, 2.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09b294a66299a2d985ee4b39361a36d0884f443fe379151c40410ee033add34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bullmq/queue.ex: FileTooLong \u2014 1021 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 61 functions. The bar is 500 significant lines; this is 521 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/queue.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5273f8d8e2efe682883564ce0c6247393dcb6d541982ac3fd10fe1d6a4d8a98e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ValkeyGlideAdapter: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/valkey-glide-client.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"570af51b6c9dfd329ebfa2c036e02a6fcfb7160fc60a70dd39e1e4f026f794bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/job.rs: FileTooLong \u2014 992 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: Job (2 blocks, 44-1523). The bar is 500 significant lines; this is 492 over it, 1.98\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":"rust/src/job.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f0cb3579949672b6d618f35b54564da57b007ae4e005420349a35633ad7d42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BunRedisAdapter: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"709451f5c46fb62f6eed0a0c3d855b6c8a2e97abf0bfdea8f6fcce9ea35d0d62"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scripts: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\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":"python/bullmq/scripts.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2012b23ffaee88c22091ebbb96b5d83494031dbe99b9991fa31e9847744cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RedisBackend: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backends/redis_backend.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b49cece0e252af48e68c02e58348647ce66ea5dcdeaeaf8bf32466107f18b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Queue: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/queue.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9ac123d42ced1d4a6bef0f952f146fca99e8d5f226535527d514103be99a84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/worker.ts: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Worker (200-1659). The bar is 500 significant lines; this is 416 over it, 1.83\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":"src/classes/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"410518de5747a14a6af20f0ca6e9094ac1fad481c43dea20b6bc04e10652b3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ioredis-client.createIORedisClient: FunctionTooLong \u2014 createIORedisClient runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/ioredis-client.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3611ce66342d10ee5a87b92a96b02f8d48596496e227cfdf2542637eda43d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Backend: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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":"python/bullmq/backend.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"496198f423975471bbbbf7d4020ef8f8eddbd2a6952245285ae90522cd464952"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Job: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/job.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"777fcd295b71c37fdb6719c237250c55dbd6cf1f3c31f589015d6963b12b7ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeRedisAdapter: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. Most of these members implement redis-client.IRedisClient (36 of 51 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/node-redis-client.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f01725795a865ba08b0094b3c67373572378cc4864ae6aa1d47a2378a46d3a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/valkey-glide-client.ts: FileTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: ValkeyGlideAdapter (322-1220). The bar is 500 significant lines; this is 333 over it, 1.67\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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7495d37614b1c510255239f76d810ef3ffa206be780e1cae3489989327ea73"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Job: ClassTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 249 over it, 1.62\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":"src/classes/job.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0881101072a2c4cf291a7dab8e68eba07bf8f49165631d391f628cab349c299b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_producer.rs: FileTooLong \u2014 793 significant 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 77% of them inside a single declaration: FlowProducer (2 blocks, 224-1216). The bar is 500 significant lines; this is 293 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0707518084bdefe719eb768027d64766237bee5f2285a56bf7b9657706f5223a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/bun-redis-client.ts: FileTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: BunRedisAdapter (123-1233). The bar is 500 significant lines; this is 291 over it, 1.58\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":"src/classes/bun-redis-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ca644ba8ba5e4cf6be85bbee230bdf87892b81b7dac5b47151ca4d1dd5c5ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Worker: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb3f748a52928d691b5777c32e4c0842a952021a8981b107180910abd785abd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FlowProducer: ClassTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 224-1216. The bar is 400 significant lines; this is 211 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b5ceecfd64e6575bc79ab784fb1a1b0ee1520d51d5635a4f0c92e68c99012d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: BullMQ/RedisBackend.cs: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 259 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b66ea380df18f86514d126b7013950e0f09b4119333dd1ced250d26d24efb50"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BunRedisAdapter: ClassTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 400 significant lines; this is 207 over it, 1.52\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":"src/classes/bun-redis-client.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5868031054d109a8661538c73b121adbe686f3534da61be26b57e92bab8db1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/redis.ex: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 87 functions. The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd4963b61ca813799ccc58351c08e8691739369148677379a08dad708ac0d76"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Worker: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9356c944875bccada12ed969f25cb5ffcf9dbfc7838e3f2a9aa4bd6b4d5a28fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Queue: TooManyMethods \u2014 183 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Queue.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2982cfa7c0e07486bb790e6a85c7adcce0932f095a64fe6f6390e92a8195492"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Keys: TooManyFunctions \u2014 43 functions. The bar is 30 functions; this is 13 over it, 1.43\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/keys.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda6a2e97d197833c740ef8b8ed075a1b428416f3e2e952e1c5e098e5f133cc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/job.ts: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Job (64-1439). The bar is 500 significant lines; this is 211 over it, 1.42\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":"src/classes/job.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"587046bcb80fadfb598646c6ddb9d03797ebc17966dd4c1caeccbdf48cb7ef1b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ValkeyGlideAdapter: ClassTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 400 significant lines; this is 164 over it, 1.41\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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af24251a27823a207453489206402d9c427b20d3de648f18523fb2a89a86ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/postgres_backend.py: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad87149cbfcb19e09c313a6e30062fdffd48a7108bde107ccd62a11aba704ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueueGetters: 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":"src/classes/queue-getters.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7723d1039f8d2046a2841058792bd6615c480edde281227d263fbb27a5d8e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Queue: 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":"src/classes/queue.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d570523d62c2cb9932d94c1896177365b105492e3629601ee2bbd365cd04697e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/node-redis-client.ts: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: NodeRedisAdapter (192-940). The bar is 500 significant lines; this is 145 over it, 1.29\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":"src/classes/node-redis-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0b96b23b6da958b8ebf503f308fc1b5a163c85a66242a6fd84d97e67d23f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bullmq/scripts.py: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/scripts.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb606e9650f0a4cb73f06197dcfa360be28ee75552954eda784535e3f5e259"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: BullMQ/PostgresBackend.cs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"784708e44e2e50ac911a9cba4f00eab7b7dfad0dc4b5087b2d3666a35002475c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JobScheduler.upsertJobScheduler: MethodTooLong \u2014 upsertJobScheduler runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/classes/job-scheduler.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0568ad53adef1414a662dad77f0dcd08a700be8900762e566478dadbc9085538"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sandbox.sandbox: FunctionTooLong \u2014 sandbox runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/classes/sandbox.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddffea5ba2bff00b9a43ffcaa6c152ad9d64b547c79e85133428772442a91cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sandbox.sandbox.process: FunctionTooLong \u2014 sandbox.process runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/sandbox.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dc9faf8ce27f609ec8fc8ed897c0625397896d50666951b8a3571c192c027b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Worker.process_fetched_job: MethodTooLong \u2014 process_fetched_job 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":"rust/src/worker.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6b07209bd8587fb988361c7b845958cbca9fada071d66a4a3da45cb9af9574"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChildProcessor.wrapJob: MethodTooLong \u2014 wrapJob runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/child-processor.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9ad4a9396ff99d8dbe650b5f8141eec5399ac3fd4d9e62edfc50640db82c8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RedisConnection: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 45 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"03139c06fae6168108cc64173ee5f4ec1636898357b346048129cf7463795244"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Queue: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/src/Queue.php"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"33204343dbe6d4d3dc21f580213e3fec4964e1e76f2d7908af5921c21bc32a25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Queue.upsert_job_scheduler: MethodTooLong \u2014 upsert_job_scheduler runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b0c1bee2110491eb85c5559f4862b317a4c9e15009129c016790ed2a67665f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScriptRegistry.embedded_scripts: MethodTooLong \u2014 embedded_scripts 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":"rust/src/scripts.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb3fa435547a4234c99772ff22041bc925a8302b3711cfd8d4b969641b7abe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bullmq/job.ex: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 52 functions. The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b527b89f200abdf92e5b00dc43c2cf9d3868018fff2ce240ddf68904ab27684"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classes/redis-connection.ts: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: RedisConnection (153-910). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81566e31996d54287ba26cbb10c5e89dd43a61508d9950a5d62be79209f898ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScriptLoader.resolveDependencies: MethodTooLong \u2014 resolveDependencies runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/commands/script-loader.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8da05b3affe1744ebbf1ed8f3275615a00f61c3275e1bf2d230f7692c633e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cad99f941403f48b8c781fdf6383fe58992a494d4bd0fd52476381fc9c20bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NodeRedisAdapter: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 15 over it, 1.04\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":"src/classes/node-redis-client.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c537616ee5a94cecda1b5a0511f8e9730d1a9b72bb4f931977094d3f3201e28f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bullmq/job_scheduler.ex: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5646a0a935ae76d6529f0e03b37c28749c187f34b0539ea976760997c3b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): rust/src/worker.rs:1943-2002 | rust/src/worker.rs:2013-2081 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"e736831aaec4d408e6a3080ddc295105e268f6ab36a5ed51eff142e8e3c81b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): rust/src/queue.rs:906-985 | rust/src/queue.rs:996-1105 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a4507e82f2b367a4616a52760c0fcd6eae0c0357cf863c41f2d975108cd325"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): elixir/lib/bullmq/scripts.ex:326-382 | elixir/lib/bullmq/scripts.ex:464-529 | elixir/lib/bullmq/scripts.ex:539-580 | elixir/lib/bullmq/scripts.ex:634-693 | elixir/lib/bullmq/scripts.ex:702-767 | elixir/lib/bullmq/scripts.ex:777-821 | elixir/lib/bullmq/scripts.ex:851-910 \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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db6e4da9c4e913c447cdbd29a983b6be804b9a9d0d032e2fbe4342874b7d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust/src/flow_producer.rs:1038-1110 | rust/src/job_scheduler.rs:147-210 | rust/src/job_scheduler.rs:220-375 | rust/src/queue.rs:523-596 | rust/src/queue.rs:2857-2894 | rust/src/worker.rs:1460-1584 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"110e22f0b1f80eea6fd19cda9a349034d851136323484ae3c765ab5f743fa3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): rust/src/flow_producer.rs:947-1035 | rust/src/queue.rs:445-520 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abef82704a468b51976ba165ac730d835dbf871a002d99098d67578bd1088cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): rust/src/flow_producer.rs:295-356 | rust/src/flow_producer.rs:367-454 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/flow_producer.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef1260ba4e5ae22666a76cf3e7e69bf47e2610457a4c719e468509f39892cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust/src/job.rs:868-906 | rust/src/queue.rs:1791-1824 \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":"rust/src/job.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ee1abe33a7ec0f966b41f698388a3b5aca236b15bbabf5481673ff6cc77cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust/src/job.rs:492-540 | rust/src/queue.rs:1756-1788 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7018dc22573bee2c0b558c939a1ea396c82d4032e903f5cff1e1859ef78484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust/src/queue.rs:2039-2081 | rust/src/queue.rs:2086-2122 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0489ab3d6c51ce2b5f7ac3cc4cbebaf38cedd1f6ae3424afe241913cbe6022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): elixir/lib/bullmq/backends/postgres.ex:458-504 | elixir/lib/bullmq/backends/postgres.ex:509-558 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc6b2ca9759100662b4ec0ac9c5c13fd25e947cba5e54ff8adf654dce09e853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): python/bullmq/backends/postgres_backend.py:421-448 | python/bullmq/backends/postgres_backend.py:454-483 \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":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4553d834dacf53ff06fd258581c500abf7f495411167f95b2117567ea35c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 34\u002B corresponding lines): rust/src/job.rs:976-1012 | rust/src/job.rs:1017-1055 | rust/src/job.rs:1061-1102 | rust/src/worker.rs:1769-1802 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e3dbc41993a2288234574875b96c6876edd0f51f16092aaa449a7e7ce158d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): elixir/lib/bullmq/worker.ex:1501-1532 | elixir/lib/bullmq/worker.ex:1873-1907 \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":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe915ea37768651d896be0f6fe5e44a9defd2a791045657f1ddbadc0ce80547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): rust/src/job.rs:630-670 | rust/src/job.rs:673-705 | rust/src/job.rs:708-739 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 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":"rust/src/job.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d2c206e4911ffe7d7b7a88858591e37cf7b66a6e89c01c0cf294e71137c619"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust/src/job.rs:377-405 | rust/src/queue.rs:1708-1731 \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":"rust/src/job.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"808a113033d14f308c500dfc64143fcd203a1f868edc38a7ff2329201c9e28a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust/src/queue.rs:2224-2245 | rust/src/queue.rs:2432-2455 | rust/src/queue.rs:2780-2801 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1e67dd3a446f12f3d71d87e21b9f6c734d4ca8961574aec97deb7265f43a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/src/worker.rs:807-825 | rust/src/worker.rs:828-846 \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":"rust/src/worker.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b336210b503a411b2a1a283d097fad1c72e0640436499e2362e52b5c9ffa32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): dotnet/src/BullMQ/PostgresBackend.cs:139-159 | dotnet/src/BullMQ/PostgresBackend.cs:162-179 \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":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8feb72f714fbba14047a4d08f91c9c1491b1b1fee5d6e910034cd39a193da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): elixir/lib/bullmq/job.ex:630-649 | elixir/lib/bullmq/job.ex:684-708 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job.ex"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4066b9cc834feba6742d8dcfee30d46e875508b54e8a6c4ad6ac4ae719467c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): elixir/lib/bullmq/backends/redis.ex:992-1002 | elixir/lib/bullmq/backends/redis.ex:1006-1016 \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":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b416510e1abdc9518864c28adeb78de3d79b27160bd10ad2ef2d21a725c0cd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): elixir/lib/bullmq/worker.ex:1852-1868 | elixir/lib/bullmq/worker.ex:2475-2491 \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":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b258f9833032326c466d271d7e6dc7c99dfcd43924cb8d4cb94df09c1d4cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rust/src/queue.rs:745-770 | rust/src/queue.rs:774-799 | rust/src/queue.rs:1897-1914 | rust/src/queue.rs:2002-2027 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e219933419018c773b45b562927f44aca0e45438db8799a13521f0bfb5ca386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): elixir/lib/bullmq/scripts.ex:2037-2055 | elixir/lib/bullmq/scripts.ex:2059-2077 \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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"499dd592de94b1d1a83ef9d9bf0e79a2a0661f2bd0fa7de98ecca6df1ef5bec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): elixir/lib/bullmq/redis_connection.ex:504-523 | elixir/lib/bullmq/redis_connection.ex:648-659 \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":"elixir/lib/bullmq/redis_connection.ex"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"698dbc2116c7a8a5cc0e94854eb4e8c758a5ec9c7416359610c30878fdb4d21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/src/job.rs:347-362 | rust/src/job.rs:468-483 \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":"rust/src/job.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc25b9a5e7ea573183657620c2f7f508086d78c90eb55bb44ec30e139cec0ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): dotnet/src/BullMQ/RedisBackend.cs:864-870 | dotnet/src/BullMQ/RedisBackend.cs:873-879 \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":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"367836041eeed14ea7095052fcd5873e8504877b34677d1d9f3fd43ffa24c7c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): python/bullmq/scripts.py:586-599 | python/bullmq/scripts.py:711-723 \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":"python/bullmq/scripts.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20f783eaf4497d3562648937590cb5d3ecaa45a6f5342547c4d206311165058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/src/queue.rs:120-136 | rust/src/queue.rs:143-158 \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":"rust/src/queue.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65a4d877e75399753cbe05f7ef1300f8a7986ca2bad9a498d1f25fba968733e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): elixir/lib/bullmq/backends/postgres.ex:1071-1090 | elixir/lib/bullmq/backends/postgres.ex:1102-1116 \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":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa9099450bdb710162359a0a1d47946cafce2a3327a3843024f678b23e476f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/src/flow_producer.rs:1113-1120 | rust/src/paginate.rs:45-52 \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":"rust/src/flow_producer.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d091d560cfbb0ef68566bcedce8393f45f5a25e65a8fbeafa70bde04abbe674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): elixir/lib/bullmq/scripts.ex:1481-1493 | elixir/lib/bullmq/scripts.ex:1638-1657 \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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bb27a18d173127e80c975239582575850b3b068f08a1f401f72e1a4a79c989"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): dotnet/src/BullMQ/RedisBackend.cs:582-601 | dotnet/src/BullMQ/RedisBackend.cs:636-649 \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":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"3321fbb3b1f409a15706c110db95da741091fc4bdf570486e6020c99ecaf3d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): elixir/lib/bullmq/backends/postgres.ex:959-966 | elixir/lib/bullmq/backends/redis.ex:748-755 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"344fe7a97b3ee50e3586a590443cfb795e3e0edfb428d1350fbc056a99440fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/src/redis_connection.rs:357-363 | rust/src/redis_connection.rs:368-374 \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":"rust/src/redis_connection.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8da294b5fa95f7a9b923a30b0dd203a6274b1f41203d447ecdbe5c78861c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): dotnet/src/BullMQ/Job.cs:259-273 | dotnet/src/BullMQ/Job.cs:282-298 \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":"dotnet/src/BullMQ/Job.cs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ead97d34d3d4b6500b39cded1747be3d84eccb4664c75ed57100b02e00e401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust/src/queue.rs:1695-1705 | rust/src/queue.rs:1734-1744 | rust/src/queue.rs:2358-2366 \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":"rust/src/queue.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b223aad0a7a5f6e744129e1270345d51fd6c99917552a0b2dbb8b7b56a9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): elixir/lib/bullmq/job_scheduler.ex:414-421 | elixir/lib/bullmq/stalled_checker.ex:127-133 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"613964ccc7be89762385a0220db9f9179e3b6ee4cbb3cece13e875f685a07b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): rust/src/queue.rs:729-741 | rust/src/queue.rs:2128-2141 | rust/src/queue.rs:2158-2170 | rust/src/queue.rs:2173-2184 | rust/src/queue.rs:2187-2201 | rust/src/queue.rs:2204-2216 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"171d5a7dfa1f49b60d4792681a3298b93b2e9584051be453f04c9f2d15c3618c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): elixir/lib/bullmq/job.ex:575-586 | elixir/lib/bullmq/scripts.ex:2208-2217 \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":"elixir/lib/bullmq/job.ex"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf079a18af77c15adde3c2437e11df49b579af7d643dce3d1ea896b4edb61b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/src/flow_producer.rs:1201-1210 | rust/src/queue.rs:357-366 \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":"rust/src/flow_producer.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"50af8cd5b5130d9f9484df5daea3f4e23a55a1297b96e95f68fb22ea963cb79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): dotnet/src/BullMQ/Worker.cs:76-100 | dotnet/src/BullMQ/QueueEvents.cs:105-120 \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":"dotnet/src/BullMQ/Worker.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7dc36c54848a40e5e528d95f78c8895d96ab1c75ad05c6df499cc8aeb73358"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): dotnet/src/BullMQ/Postgres/SqlLoader.cs:75-80 | dotnet/src/BullMQ/Redis/LuaScripts.cs:84-89 \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":"dotnet/src/BullMQ/Postgres/SqlLoader.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b323be2f6e7a637d60e3d3e55cde23130b8fe949e416dfab382e675a371d38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): dotnet/src/BullMQ/Queue.cs:28-38 | dotnet/src/BullMQ/QueueEvents.cs:123-131 \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":"dotnet/src/BullMQ/Queue.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee3ce5193c439e3b83d690646242750bf5554306d044e0e4128d8bc60c7dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): elixir/lib/bullmq/backends/redis.ex:1020-1022 | elixir/lib/bullmq/job_scheduler.ex:834-839 | elixir/lib/bullmq/queue.ex:1972-1974 | elixir/lib/bullmq/queue_events.ex:434-436 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f513c4766911cd81724b881d1529d9ef9427338727216c4222c2ee1466adc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): elixir/lib/bullmq/backends/redis.ex:82-85 | elixir/lib/bullmq/redis_connection.ex:593-596 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cffa9d2f1e84a9b95ba23a0382acc7f41aa450e7c5cf7876f249926ba1b6f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201345 lines \u00D7 6): elixir/lib/bullmq/scripts.ex:483-527 | elixir/lib/bullmq/scripts.ex:549-578 | elixir/lib/bullmq/scripts.ex:647-691 | elixir/lib/bullmq/scripts.ex:721-765 | elixir/lib/bullmq/scripts.ex:790-819 | elixir/lib/bullmq/scripts.ex:864-908 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/scripts.ex:483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060elixir/lib/bullmq/scripts.ex:785\u0060 calls \u0060waiting_children\u0060 and \u0060elixir/lib/bullmq/scripts.ex:642\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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d188e67e248964524301aef08fa5931d4061828df1e4fa07e10c4167c337ff91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): elixir/lib/bullmq/backends/postgres.ex:474-494 | elixir/lib/bullmq/backends/postgres.ex:528-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/backends/postgres.ex:474\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":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae04431d1c171cb9bca0e8759035fba9c936635b843f7fa10fa47eebe7e6e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201321 lines \u00D7 2): elixir/lib/bullmq/backends/redis.ex:532-542 | elixir/lib/bullmq/scripts.ex:1701-1721 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/backends/redis.ex:532\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":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884ebeec35725fa696d6547db3ed743e4ba41ceb100ea0616d511eec71ee705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): elixir/lib/bullmq/scripts.ex:923-943 | elixir/lib/bullmq/scripts.ex:1005-1025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/scripts.ex:923\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, \u0060elixir/lib/bullmq/scripts.ex:1027\u0060 calls \u0060get\u0060, \u0060job\u0060 and \u0060elixir/lib/bullmq/scripts.ex:945\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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c28b3c862bcc59d34e28e9965517d07ba70b84bc1912d6bcf81af1ac4b9183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201320 lines \u00D7 3): elixir/lib/bullmq/scripts.ex:332-342 | elixir/lib/bullmq/scripts.ex:464-483 | elixir/lib/bullmq/scripts.ex:539-549 \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":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0455ee9c366ffcd828198ae09d0c9f136f0a0249edc80e93364a5b7b934fcb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): dotnet/src/BullMQ/OptsCodec.cs:122-134 | dotnet/src/BullMQ/RedisBackend.cs:1275-1287 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"dotnet/src/BullMQ/OptsCodec.cs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f299e223a25aead100d1fe4662a99fa5e47b1c5e6b2d6a62c82bc1088ee8db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): elixir/lib/bullmq/backends/postgres.ex:460-473 | elixir/lib/bullmq/backends/postgres.ex:512-525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/backends/postgres.ex:460\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, \u0060elixir/lib/bullmq/backends/postgres.ex:511\u0060 calls \u0060get\u0060 and \u0060elixir/lib/bullmq/backends/postgres.ex:459\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":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c41d9280bd9145ff2ceb4d46df94d4dde996d71403acad8c47c9eca6701e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): elixir/lib/bullmq/worker.ex:1718-1731 | elixir/lib/bullmq/worker.ex:1809-1822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe3f4be7a022c9b9b05079b16a6d5d0f79248441c5cb6f15eacf9b094a08fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): elixir/lib/bullmq/worker.ex:1855-1868 | elixir/lib/bullmq/worker.ex:2478-2491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060elixir/lib/bullmq/worker.ex:1855\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":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdec76c8cbc655ca0a2352a7cd8fe17b7c41ccb07285877d351830191c32604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): elixir/lib/bullmq/scripts.ex:395-406 | elixir/lib/bullmq/scripts.ex:421-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/scripts.ex"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"465d7a2b34709cbcea5795d91e34bbbfdec8877a1d960fea53c06ee6c4d41d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): elixir/lib/bullmq/worker.ex:1515-1524 | elixir/lib/bullmq/worker.ex:1775-1784 | elixir/lib/bullmq/worker.ex:2276-2285 \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 \u0060elixir/lib/bullmq/worker.ex:1515\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":"elixir/lib/bullmq/worker.ex"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f69688c8744767662fdef46017c4879b91a136abbbc21573e5abcad4784e517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): elixir/lib/bullmq/job.ex:641-649 | elixir/lib/bullmq/job.ex:700-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job.ex"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce78f4abc456388102a832fe815ab1678ecac6a23df44bd9c368e64ac077505c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): elixir/lib/bullmq/backends/redis.ex:202-209 | elixir/lib/bullmq/backends/redis.ex:224-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b749a37342c271970a59dd21f07bf21e83fef25519ca8cac3b38f222e99526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): elixir/lib/bullmq/queue.ex:1678-1685 | elixir/lib/bullmq/queue.ex:1696-1703 \u2014 both copies are in the same file, so extract the block 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, \u0060elixir/lib/bullmq/queue.ex:1695\u0060 calls \u0060merge\u0060 and \u0060elixir/lib/bullmq/queue.ex:1677\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":"elixir/lib/bullmq/queue.ex"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"085402f2f809b11df816fc0c38f73c691698f5b29e9e63e428d27a09339c29f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): dotnet/src/BullMQ/PostgresBackend.cs:150-154 | dotnet/src/BullMQ/PostgresBackend.cs:170-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dotnet/src/BullMQ/PostgresBackend.cs:150\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":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020ae074c96af9eecb2cf2e367da06f1a46753e79941602fe4192b6ade8c806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): elixir/lib/bullmq/queue.ex:385-391 | elixir/lib/bullmq/queue.ex:406-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/queue.ex"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7d057598e4f24d4cebfdcbc94af677f760711f954791c0b8c102a4b11d7312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): dotnet/src/BullMQ/Postgres/SqlLoader.cs:76-80 | dotnet/src/BullMQ/Redis/LuaScripts.cs:85-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"dotnet/src/BullMQ/Postgres/SqlLoader.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b23738ef2e4e676d42af89d2f3aaac489ec25425ea52417c732f944e881f0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): elixir/lib/bullmq/backends/redis.ex:269-283 | elixir/lib/bullmq/queue.ex:1918-1932 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c530f65c11365d41057787d1f9b1864c429eb2fddb60e15b4668196b4194682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): elixir/lib/bullmq/queue_events.ex:196-202 | elixir/lib/bullmq/worker.ex:330-336 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"elixir/lib/bullmq/queue_events.ex"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b9bb3edba0a27c792e13bd6917057053816ab3574d5a20560c77495c320d30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): python/bullmq/backends/postgres_backend.py:423-442 | python/bullmq/backends/postgres_backend.py:458-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0e18d8a567f052c299fc4a05e105ac732b43780e6d453b20c9c72599ee79c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): python/bullmq/scripts.py:131-139 | python/bullmq/scripts.py:153-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"python/bullmq/scripts.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"29793d84127841554a9b51cd954b9ab227703e3fedfa1b5fd9f124f340b9888a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): python/benchmark_backends.py:81-86 | python/benchmark_backends.py:94-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/benchmark_backends.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2436344da8e1a490d9e891ee988860dbdb2c0efe489de9d425d9963d365d23f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): python/bullmq/scripts.py:291-295 | python/bullmq/scripts.py:326-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/scripts.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b544d42659ddd72163bfb681cdeffe9ecde950713c33c954ea3e67e2d2d010e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): rust/src/flow_producer.rs:1039-1070 | rust/src/queue.rs:524-556 \u2014 before extracting anything, compare \u0060rust/src/flow_producer.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/flow_producer.rs:1039\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":"rust/src/flow_producer.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde9d0de50d3f19e2754bf07268c66c222eca3e60411d6098d9fe7274096ecdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): rust/src/job_scheduler.rs:333-361 | rust/src/worker.rs:1542-1570 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:333\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":"rust/src/job_scheduler.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcbfe6abc93fd72a2f60395aa9a944ffc37f4b362fe64257ea29f3e99a7998b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): rust/src/worker.rs:1152-1175 | rust/src/worker.rs:1199-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/worker.rs:1152\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":"rust/src/worker.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6eb65f74a6b68ad523b60ea8a9dc25f52da3ab75b511ecf5f6ffc069fc8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): rust/src/job_scheduler.rs:296-314 | rust/src/worker.rs:1495-1511 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"26feef93a18d33c62545507b0941ea3479a41f94d646e02ed86b0e85408e337f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust/src/flow_producer.rs:1087-1104 | rust/src/queue.rs:573-590 \u2014 before extracting anything, compare \u0060rust/src/flow_producer.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/flow_producer.rs:1087\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":"rust/src/flow_producer.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4152e6279fd77472f2fbd97d53d11f6adf0c8673d4fc661ffe798df85ba243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): rust/src/queue.rs:937-953 | rust/src/queue.rs:1027-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:937\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, \u0060rust/src/queue.rs:1041\u0060 calls \u0060Int\u0060, \u0060Some\u0060, \u0060to_string\u0060 and \u0060rust/src/queue.rs:954\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":"rust/src/queue.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad32cfc250e062300fb2892dcc1b30aeee38c7d5277361d37217971e26fb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): rust/src/job_scheduler.rs:354-369 | rust/src/queue.rs:2877-2889 | rust/src/worker.rs:1563-1578 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:354\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":"rust/src/job_scheduler.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf9c6614e0654c6022296230447b9a24b242ce4bc881ce3eb00b50eb1a402e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/src/flow_producer.rs:1000-1015 | rust/src/queue.rs:489-504 \u2014 before extracting anything, compare \u0060rust/src/flow_producer.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/flow_producer.rs:1000\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, \u0060rust/src/queue.rs:505\u0060 calls \u0060write_nil\u0060, \u0060unwrap\u0060 and \u0060rust/src/flow_producer.rs:1016\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":"rust/src/flow_producer.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2946a44c99798001758d3c4033840549be5b12c25f1aed6028a111cd6f4f9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/src/worker.rs:1967-1982 | rust/src/worker.rs:2037-2052 \u2014 both copies are in the same file, so extract the block 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, \u0060rust/src/worker.rs:2053\u0060 calls \u0060to_string\u0060 and \u0060rust/src/worker.rs:1983\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":"rust/src/worker.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"7902ac665433dc92e975f957b6dba807d286f79faaf0e05dd655c352a5f6ae5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): rust/src/queue.rs:924-934 | rust/src/queue.rs:1010-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:1010\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/src/queue.rs:1009\u0060 calls \u0060to_string\u0060 and \u0060rust/src/queue.rs:919\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":"rust/src/queue.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205965b8d6b7899d36e601d1ea7fabf89ee8464bfa322d10dcac1745edecd4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust/src/worker.rs:366-379 | rust/src/worker.rs:437-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/worker.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b424d6b732591c54a131e930243bf14b4e115111febf3c517ddae3800986d7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust/src/flow_producer.rs:337-348 | rust/src/flow_producer.rs:432-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/src/flow_producer.rs:427\u0060 calls \u0060push\u0060 and \u0060rust/src/flow_producer.rs:335\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":"rust/src/flow_producer.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a21ec5a78912e7bb20ae66566c5afcc88c6c79adecd60e8b151be3324a516f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/src/flow_producer.rs:865-878 | rust/src/queue.rs:305-318 \u2014 before extracting anything, compare \u0060rust/src/flow_producer.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/src/queue.rs:301\u0060 calls \u0060timestamp\u0060, \u0060opts\u0060, \u0060as_deref\u0060 and \u0060rust/src/flow_producer.rs:863\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":"rust/src/flow_producer.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e155268a924a09345066141d7405fcc94d00038ce19735215a2feeb2b99c468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/src/job.rs:390-405 | rust/src/queue.rs:1716-1731 \u2014 before extracting anything, compare \u0060rust/src/job.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:390\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":"rust/src/job.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"001d0c24c0df75d2cbabc2497328612a68a59ed86743271fd47269eb3143e2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/src/worker.rs:812-825 | rust/src/worker.rs:833-846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/worker.rs:812\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":"rust/src/worker.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abaf1c88f592d2bd66dae875969e91ccb20bfe3a5eaeb9a11ead1b84b41e774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/src/flow_producer.rs:316-330 | rust/src/flow_producer.rs:405-419 \u2014 both copies are in the same file, so extract the block 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, \u0060rust/src/flow_producer.rs:393\u0060 calls \u0060with_capacity\u0060 and \u0060rust/src/flow_producer.rs:313\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":"rust/src/flow_producer.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ca3cd531c358244b78bd57f160168309553bbcacbf3678b90465d57343fc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/src/job.rs:330-342 | rust/src/queue.rs:1677-1689 \u2014 before extracting anything, compare \u0060rust/src/job.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:330\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":"rust/src/job.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0729185291f672b672480e67fc368da4688b91d17300548a638598fa06e1b5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): rust/src/job_scheduler.rs:189-199 | rust/src/job_scheduler.rs:310-321 | rust/src/worker.rs:1507-1517 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/src/job_scheduler.rs:202\u0060 calls \u0060with_capacity\u0060 and \u0060rust/src/job_scheduler.rs:323\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":"rust/src/job_scheduler.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"178aa392361d1c90dd70679740d253aa47f36f51071177b538cd5f1ddbc6a650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust/src/job_scheduler.rs:282-293 | rust/src/worker.rs:1469-1479 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9590ba0a47a48ffd506f6033eab6f04c29a7facf632692fa3559f81aee9e6817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust/src/worker.rs:300-310 | rust/src/worker.rs:313-323 | rust/src/worker.rs:2135-2145 \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 \u0060rust/src/worker.rs:300\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":"rust/src/worker.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c6aa2d99de54045eff9f2b8445d49bc7029d60d1f52cdaae514caa067f3573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/src/job.rs:896-906 | rust/src/queue.rs:1814-1824 \u2014 before extracting anything, compare \u0060rust/src/job.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:896\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":"rust/src/job.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6bd89cce905d59e46a942cd37b726eb5abb014093764865236601a529686b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/src/job.rs:1041-1051 | rust/src/job.rs:1088-1098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:1041\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":"rust/src/job.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4aebfaae06b9dddc12c8f3e8aca9c877a2b22092ad80a57bbd8b05fd46f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): rust/src/worker.rs:383-399 | rust/src/worker.rs:487-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/worker.rs:383\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":"rust/src/worker.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e3263be30fe0215bc6fe5dc03d543cc159a173c6d0f4ea14a57c598a01bb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust/src/job.rs:590-599 | rust/src/job.rs:1042-1051 | rust/src/job.rs:1089-1098 \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 \u0060rust/src/job.rs:590\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":"rust/src/job.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f40cd90bc291fd63ade5ccb24715a79a9c5706ba3195e9a4d2d3a2305aa15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 6): rust/src/flow_producer.rs:1102-1110 | rust/src/job_scheduler.rs:202-210 | rust/src/job_scheduler.rs:367-375 | rust/src/queue.rs:588-596 | rust/src/queue.rs:2887-2894 | rust/src/worker.rs:1576-1584 \u2014 before extracting anything, compare \u0060rust/src/flow_producer.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/flow_producer.rs:1102\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":"rust/src/flow_producer.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b251217301e165b68ec42af9adf502203e41b56938b80bb5d454db6a5636757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 4): rust/src/queue.rs:1519-1522 | rust/src/queue.rs:1772-1777 | rust/src/queue.rs:1867-1875 | rust/src/queue.rs:2793-2798 \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 \u0060rust/src/queue.rs:1772\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":"rust/src/queue.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42e6f7f1e2c3700bf22a1f348c5393fbc3468ba174cec8edf2b62f632feb65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/job.rs:1261-1269 | rust/src/worker.rs:2015-2023 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060rust/src/job.rs:1261\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":"rust/src/job.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e86b626ce38fb1b7262688229b42281231d347e5367817c2130243a7d26ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust/src/queue.rs:556-564 | rust/src/queue.rs:2871-2878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd168101d583c37fe2c9b262ebd9b061773f929c927b1f9900c4258aec3d1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/queue.rs:1169-1177 | rust/src/queue.rs:1271-1279 \u2014 both copies are in the same file, so extract the block 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":"rust/src/queue.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2e88d96b088f03643881114414b1aa0fc2a5c47f19b73e4bee500febc54efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust/src/worker.rs:1914-1921 | rust/src/worker.rs:1992-1999 | rust/src/worker.rs:2071-2078 \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 \u0060rust/src/worker.rs:1914\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":"rust/src/worker.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b416436ef3116e36e354ad4bfcde5fbcc03b96dad9818b56e63c6e46629482d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/src/job.rs:378-385 | rust/src/job.rs:420-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe3371f1ee2d29cd8f8f0d39612fa7930dec64ad136034b29e49d8bc4f26ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust/src/job_scheduler.rs:323-330 | rust/src/worker.rs:1520-1526 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:323\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 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":"rust/src/job_scheduler.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f8610db3a707bed10a0278fb73e33c6a89f6b62431842fa451a2a52fecbb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): rust/src/job.rs:1006-1012 | rust/src/job.rs:1049-1055 | rust/src/job.rs:1096-1102 | rust/src/job.rs:1328-1334 | rust/src/worker.rs:1996-2002 | rust/src/worker.rs:2075-2081 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:1006\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":"rust/src/job.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9ae319626f7150c1a04337e3df3628cac84b1d1a676027a5094bff4d20470c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/src/job.rs:1226-1232 | rust/src/job.rs:1323-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:1226\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":"rust/src/job.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1fb098f06d0b3df7d9fdd9aee5f7a75bdab109388a79e2a8d4c2a2abcf7cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/src/queue.rs:912-919 | rust/src/queue.rs:1002-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:912\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, \u0060rust/src/queue.rs:1009\u0060 calls \u0060to_string\u0060 and \u0060rust/src/queue.rs:924\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":"rust/src/queue.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef666bfaa274f9e5e51dc7b21c9fbbb6c8912a66b6aa8f962a0e0a19556e1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/src/queue.rs:2449-2455 | rust/src/worker.rs:1796-1802 \u2014 before extracting anything, compare \u0060rust/src/queue.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:2449\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":"rust/src/queue.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"4016e09a408928049a924f357766eea74d8f86a295b45404beeb41e7560b3c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust/src/job.rs:1046-1051 | rust/src/job.rs:1093-1098 | rust/src/job.rs:1227-1232 | rust/src/job.rs:1325-1330 \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 \u0060rust/src/job.rs:1046\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":"rust/src/job.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09b56015d554ab4ec1b3faea6bdd4b870c0407a5227e0f5d7f65fe9d668024c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust/src/job_scheduler.rs:333-340 | rust/src/queue.rs:2862-2867 | rust/src/worker.rs:1542-1549 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:333\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":"rust/src/job_scheduler.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c50d05264ee0ced80acae2e8d156873a707a80e6d0c682217d5aaca32d324a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust/src/queue.rs:2236-2241 | rust/src/queue.rs:2307-2312 | rust/src/queue.rs:2683-2689 \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 \u0060rust/src/queue.rs:2236\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":"rust/src/queue.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"66df702cd6f50398807910c8bb6ff53095aea1297a69de758163a2ff0e5d68ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/src/queue.rs:2645-2652 | rust/src/queue.rs:2685-2690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:2645\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":"rust/src/queue.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edbb9c0e68ae7ffb2e7d38c1e5a2721363c33d2e828d23585bef42745352636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/src/redis_connection.rs:358-363 | rust/src/redis_connection.rs:369-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust/src/redis_connection.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc19b86019a13cd8ae2973253645e89551fd1217d907ca39713761f0d64a22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rust/src/job.rs:1005-1009 | rust/src/job.rs:1048-1052 | rust/src/job.rs:1095-1099 | rust/src/job.rs:1229-1233 | rust/src/job.rs:1327-1331 | rust/src/job.rs:1385-1389 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:1005\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, \u0060rust/src/job.rs:1382\u0060 calls \u0060unwrap_or\u0060, \u0060as_bytes\u0060 and \u0060rust/src/job.rs:1227\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":"rust/src/job.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63e1ad6ae841f9c0315e840514bd184253c44ff3f5c5c479b936249f2f4408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust/src/job.rs:597-601 | rust/src/queue.rs:1773-1777 | rust/src/queue.rs:1868-1875 \u2014 before extracting anything, compare \u0060rust/src/job.rs\u0060 and \u0060rust/src/queue.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:597\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":"rust/src/job.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ed71a69d28fbadf3429532353b51c6bdb603eb68585d57c92fe7c12d28d563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust/src/job_scheduler.rs:165-169 | rust/src/job_scheduler.rs:289-293 | rust/src/worker.rs:1475-1479 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aca40f62964e0fbc7c1bf1251ee01f9ef246c10ee94b2efb878a69b3f7d9036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/worker.rs:1947-1955 | rust/src/worker.rs:2017-2025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/worker.rs:1947\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":"rust/src/worker.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a849d1682b50362e39033d60533eccca15a100bc418e6878e4d2c85da6c85b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust/src/job_scheduler.rs:156-163 | rust/src/job_scheduler.rs:299-307 | rust/src/worker.rs:1498-1505 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:156\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290e4264de8c2ed18c7dca4251c05b47b87939ed74e60dc4350af2f217f0993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust/src/job_scheduler.rs:174-181 | rust/src/job_scheduler.rs:292-300 | rust/src/worker.rs:1492-1499 \u2014 before extracting anything, compare \u0060rust/src/job_scheduler.rs\u0060 and \u0060rust/src/worker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job_scheduler.rs:174\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":"rust/src/job_scheduler.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c112a0a6059094f52af3db43aaf833e564ef61ea1c3a560d8f45805518e00193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/job.rs:1027-1035 | rust/src/job.rs:1131-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:1027\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":"rust/src/job.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"23891c51808bbc9a2e212e1f3885ef9f83ad4443b9d11fc333bb525e2e75b395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/src/job.rs:652-660 | rust/src/job.rs:692-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/job.rs:652\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":"rust/src/job.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08224bc1032d762596ef585d6266c8f451b0232b013f1353a08ed1b7d4c4ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/src/queue.rs:756-763 | rust/src/queue.rs:785-792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:756\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":"rust/src/queue.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7f6b8799ed66ed7ce531f4c8263dee6d5398937e7a95dcbbf0498412b6db39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/src/job_scheduler.rs:233-240 | rust/src/job_scheduler.rs:266-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/job_scheduler.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c136114d499641acee04156c12b31cfaa40ab7f8bd0901096c0f2f88ecc7013d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust/src/job.rs:323-328 | rust/src/job.rs:349-354 | rust/src/job.rs:470-475 \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 \u0060rust/src/job.rs:323\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":"rust/src/job.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"059c1ce4f68bc1a2f4b758f5a9bf0538e341f914dd5cd5110517034a72a02d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust/src/job.rs:322-327 | rust/src/job.rs:348-353 | rust/src/job.rs:469-474 | rust/src/job.rs:746-751 \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":"rust/src/job.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a3aa523a25ae096996123a5ea5aa32f6d3b7b5b3e925712ca6f38c060ff0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/src/queue.rs:1674-1679 | rust/src/queue.rs:1696-1701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b6950af34af8cedd2050eb0fca2faab58e05ddf0bc5132689c26f0d253cc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/src/queue.rs:643-647 | rust/src/queue.rs:650-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/src/queue.rs:643\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":"rust/src/queue.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7286bde618729ec2a6ca6ba39fd8fd550fc615cff5f1c6ac7a6020ebbc52529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/src/queue.rs:1908-1912 | rust/src/queue.rs:2019-2023 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/queue.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5573bf6f8a76c8deed3a4be53d73540f99674c35796ed4c4bb81c711a9f8de30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/classes/worker.ts: src/classes/worker.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Worker.mainLoop at line 672. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- src/classes/worker.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/worker.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"442dbaf52c248ca1b4050a8cb942ee7cd5cca22a92fd375c67a9b9aa58258a56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/classes/bun-redis-client.ts: src/classes/bun-redis-client.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BunRedisAdapter.connect at line 339. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- src/classes/bun-redis-client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c10508b33fdb69f0833e814895d3224de3a734a5e5f4379e8b5bb8ebfaf8d26"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: python/bullmq/scripts.py: python/bullmq/scripts.py changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Scripts.finishedErrors at line 847), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(flow): defer parent release until all children are added (python) (elixir) (rust) (dotnet) (#4988) fixes #4944\u201D; \u201Cfix(job): make changePriority work and read priority from the job hash [python] (#5022)\u201D; \u201Cfix(job): respect priority when retrying a finished job (python) (elixir) (rust) (dotnet) (#4926)\u201D; \u201Cfix(job): use Optional for parameters defaulting to None [python] (#4908) fixes #4905\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- python/bullmq/scripts.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/scripts.py"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc96de66505ce1c6ec7bbbbedd1556ba273b4135596ae92388f709039fbb034"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/src/scripts.rs: rust/src/scripts.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is LuaScript::execute at line 39), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(flow): defer parent release until all children are added (python) (elixir) (rust) (dotnet) (#4988) fixes #4944\u201D; \u201Cfix(job): respect priority when retrying a finished job (python) (elixir) (rust) (dotnet) (#4926)\u201D; \u201Cfix(connection): use connection manager to recover from disconnections [rust] (#4806) fixes #4742\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- rust/src/scripts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/src/scripts.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d36020e09d969e0f743f9ea463ed139c58f9b7678ba01d0acdfd8311fdcad81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/postgres/postgres-connection.ts: src/postgres/postgres-connection.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is PostgresConnection.constructor at line 191), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(connection): infer backend-specific connection options instead of hiding mismatches with casts (#4796)\u201D; \u201Cfix(postgres): retry the LISTEN connection after a failed connect (#4781)\u201D; \u201Cfix(worker): delegate maximumBlockTimeout to the backend (python) (#4644)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- src/postgres/postgres-connection.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-connection.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439bf4dd960ba5bfd934220d7baa3363ed8a7f6bdbbf6e26d5092496335f310"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: python/bullmq/job.py: python/bullmq/job.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is Job.__init__ at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(job): make changePriority work and read priority from the job hash [python] (#5022)\u201D; \u201Cfix(job): keep the latest stack traces when stackTraceLimit is set [python] (#4955)\u201D; \u201Cfix(job): use Optional for parameters defaulting to None [python] (#4908) fixes #4905\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:08:37 -07:00\u0027 --until=\u00272026-11-16 23:08:37 -07:00\u0027 --full-history --no-merges -- python/bullmq/job.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/job.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"682331d1f558c3aa97481552597efa186be445aef2faee816e4ff0f0dc644c50"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: dotnet/src/BullMQ/Postgres/PostgresConnection.cs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ba799bbdee2ede3ffe5d924f59b25d6e51849caf708d62204669836e05df6d08"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9262814cb882b5d06c4f27900fcbbd35755da202b6766f1a09c449b54e0b215"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba37396b7991db88ff2d9277d6cf96b6c6c398bae87bb30c6a9b4af7748b72ee"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f79def32437a1c26805a309db2abe7a240a6c7bcafe40411a3fbaa70df997af"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ff57b47ab9398cd4f5292fbbe236e7e98394fa985866bd2a4b3f273c958ff"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc57cf06d7e12d18dbcc07f0be6385b03644f8f58ec8d42f92d3779742d322b9"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/QueueEvents.cs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5bc373c41809be9527084fa60f4c3d16a8c9fb17e6dc9700f7d4fcbd22f942"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/QueueEvents.cs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c75845e1fcda831d7686c4a6592916bd213254e615e10a97e644b0ab621af"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ProcessJob\u0060 returns an awaitable but lacks the \u0060Async\u0060 suffix its 182 peers carry: 182 of the 183 awaitable methods of project BullMQ are named with an affix the repository binds to awaitables (182 of 183; unit: awaitable methods of project BullMQ). Peers: BackendBuilder.CreateAsync (dotnet/src/BullMQ/BackendBuilder.cs:14); FlowProducer.AddAsync (dotnet/src/BullMQ/FlowProducer.cs:70); FlowProducer.CloseAsync (dotnet/src/BullMQ/FlowProducer.cs:150); IQueueBackend.WaitUntilReadyAsync (dotnet/src/BullMQ/IQueueBackend.cs:22); IQueueBackend.CloseAsync (dotnet/src/BullMQ/IQueueBackend.cs:25). Rename to \u0060ProcessJobAsync\u0060. [rule N4b]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Worker.cs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c914ecd979b5a9459a145915a98a6bf90d9db2d2e2e0e8786c340951e4749daf"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add jobs in wait state\u0022 repeats the code it sits on: 4 of its 4 words (add, jobs, wait, state) are already in \u0060const waitJob = await queue.add(\u0027wait-job\u0027, { state: \u0027wait\u0027 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/clean.redis.test.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43fe48b9be4f4cc7605a5b00814bc44daff51be9c3f2004b2d6c74577b9a8fc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add a delayed job\u0022 repeats the code it sits on: 3 of its 3 words (add, delayed, job) are already in \u0060const delayedJob = await queue.add(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/clean.redis.test.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a366a7efdf983c5f788db04f7dd5369ad5c7ee9d8b92776e702f1aaca6ad63e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add a prioritized job\u0022 repeats the code it sits on: 3 of its 3 words (add, prioritized, job) are already in \u0060const prioritizedJob = await queue.add(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/clean.redis.test.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7ba97ca12c75c5307a4d71a9839575f4f36ed6f8d83e652e416fca1fe6cd67"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add a real job with a custom ID\u0022 repeats the code it sits on: 5 of its 5 words (add, real, job, custom, id) are already in \u0060const realJob = await queue.add(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/clean.redis.test.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9277d6a792f0045c570477faa616ffd7a55acc75ef31c8d3694ad25fd1af659"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Stub the queue\u0027s client to return our mock cluster\u0022 repeats the code it sits on: 6 of its 6 words (stub, queue, client, return, mock, cluster) are already in \u0060sandbox\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cluster.test.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3069a1ecf160a0f6cdd504022c5dafed2192933452f5ebe251990eccf5580db3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Wait for first job to start processing\u0022 repeats the code it sits on: 4 of its 5 words (wait, first, start, processing) are already in \u0060await firstProcessingStarted;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/deduplication.test.ts"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d4d340d92a428e6ee7fa40b0b47a53e3cf11a5e29a79d7a101fd8ad354c1af"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add first job with a custom jobId\u0022 repeats the code it sits on: 4 of its 5 words (add, job, custom, id) are already in \u0060await queue.add(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/deduplication.test.ts"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1264b17aab285882604adc5771eabcfd90e84d3f217926695600317bc09111fa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get active jobs from queue\u0022 repeats the code it sits on: 4 of its 4 words (get, active, jobs, queue) are already in \u0060const activeJobs = await queue.getActive();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/job_cancellation.test.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44ddcfa294246cc85cc30f3d96afadbc20104fa024d78182f55dfcf8609690a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore the delay stub\u0022 repeats the code it sits on: 3 of its 3 words (restore, delay, stub) are already in \u0060delayStub.restore();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/job_scheduler.test.ts"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74b29ca72e00b6733abf6eeab17a9354dcd139a4cf950ad7c9c427ec3e6a7e7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore the delay stub\u0022 repeats the code it sits on: 3 of its 3 words (restore, delay, stub) are already in \u0060delayStub.restore();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/job_scheduler.test.ts"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bded7fa39a771aa3ad7f219b3e1217b91017c507dfda8425a34059daff2af7a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore the delay stub\u0022 repeats the code it sits on: 3 of its 3 words (restore, delay, stub) are already in \u0060delayStub.restore();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/job_scheduler.test.ts"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f3745bf9eb7ffced41e515d46c5b710aa33b117c1e54187c684eeaf0d9d14c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Access the lock manager through the worker instance\u0022 repeats the code it sits on: 4 of its 5 words (lock, manager, worker, instance) are already in \u0060lockManagerInstance = (worker as any).lockManager;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lock_manager.test.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a8acc7c13ca237caa5356c194f8568451f8bf92eb9f35460c7a5ade8a039e8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore Job.getChildrenValues\u0022 repeats the code it sits on: 4 of its 5 words (job, get, children, values) are already in \u0060Job.prototype.getChildrenValues = getChildrenValues;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sandboxed_process.test.ts"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"419ce5a5ef69f233818718d177201173be342d0db183a208c7a29305366d7700"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check that gauge recorded values for waiting state\u0022 repeats the code it sits on: 6 of its 6 words (check, gauge, recorded, values, waiting, state) are already in \u0060const waitingRecord = gauge.values.find(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/telemetry_interface.test.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c03f887c26ca5ec121c1c81c3b2853e2d48472e1782c412d37afdd23f3353c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add spy to worker.moveToActive\u0022 repeats the code it sits on: 4 of its 5 words (spy, worker, move, active) are already in \u0060const spy = sinon.spy(worker as any, \u0027moveToActive\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/worker.redis.test.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de5ffe67898214118ceef903ca65c5ee9fdf153236233652f858baa54782c25"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add spy to worker.moveToActive\u0022 repeats the code it sits on: 4 of its 5 words (spy, worker, move, active) are already in \u0060const spy = sinon.spy(worker as any, \u0027moveToActive\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/worker.redis.test.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e686148ef3e9e2c19757e6e4170b750fbb358ddaec1234a4bebdf5b02977f85c"}},{"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":"f70ec95451f225316976679ac47f1d3f9d7763cd939f88e694be5c35f7eef1f4"},"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":"51c2d641db7556b6ecd9a923dd17abdba2ec6dc1859f77729af009c0d9a8623e"},"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":"f168f3e0953c836f328860ffca9a64d6b472b1e1179e6b66f228f74ab3950fda"},"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":"22ff252701c5c646858d4cebbb462cb708c3399dcf4a8228996eb4725b9d0958"},"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":"2b75cd9fc4fa9840843ffdee4c9914ae6e27385d625787b6307834eb6d0460b5"},"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":"01ebe61645de8fdb907dfc093b7f677030ba994cfa09228aa62dde4c42d8d2b0"},"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":"3098f63e13a18be65f1189a4a9a505eb543664c0e8a170a4051d31ac33b09083"},"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":"1d3c5e2bf15228a0ae58eeb4c081856e9faab665cf5ec0de1d673c96c0a2f221"},"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":"baa810e3e02b56c6129d1c9b18a2930c21fba04234e9814ce05473544c636e42"},"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":"7e1f149f761eff8ca56366804d32750adcaacc30db8f7be390477d41fe1e129f"},"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"}},{"id":"CICD-SEC-8","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":"cbc41fa0afea954512c45fb4468e8f8b132116d65bf159926764c03a0684151d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05224bb55035e5f6f668d68c17ba29c7490754839914324010f1da7786268371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a38e019f7d34b8fb71c02b4054cef0ed13316d812e0f55282a26154c89926e0a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12c2c95db49a1087c18cd3d4075d3e62a697c3d16e6f10344cca1010e7e61ac7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a73968c183a8ea5e7fd47e7ec57c3c483c98cf7d443a7f4fadbecccf4f881af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bef555c059d3f9d8f382c844c3e91b9012e00c1c879385276726a68756550285"},"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":"ae2e5aa90fadfc607df6dbc99a68ef58d8ac05e82260b99ca668bde753facaf4"},"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":"8dfabd57851c7bcb37baa8e9aafb9e1c51d861648a6ef22c4073e3d726c8c5f1"},"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":"5d4d6ef5536e3339421581c9689d48c11e4130143daef7697fe9283bd3bdd59f"},"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":"a409819043b7d3199c31319a4bbc1ec9a4bd410b69ce9912851839b514cb5c7f"},"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":"bd014ac1886dc422b322763702967821baa6fd6642af4483bb8bf5adf51b2aac"},"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":"195cfd11c1dbc36777a42a32eafb80189ed8d3311f21b100dc50d8a8e5fb0743"},"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":"026962353b3af2a6fb205860adfc2e35932b3548d33b29336d8bacd46cfae734"},"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":"b732a9eb5ec9881c98058fae5e3106bc8a2c03fce761b1f74ee89c811ba20913"},"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":"62a3bf2d76b4b1eaa874a0e6d7812e2d86d85416b51bb885e0386e15c10543cd"},"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":"23e8583aa3428cf78612e7bf6ff0a06076a50c95ce91a33bc4f7f659e7daa162"},"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":"0b3026e4c5ba37530e8cab6a64e81ea9ccfc7cf4d043a7806c32c08299e81e85"},"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":"9e6439c90c5ad6fde6d7aa345bf1fac621bd12a23d52d3e010e192d5dd5e52f8"},"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":"64b08e9d8c86e17097416b7eb755b90051493c0d7eac5a3440ed8b7769bf89c8"},"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":"920b0195d2a42163e9f1a21c7fb6dddbebdfbb0bb538682ec110d78d8baa8cae"},"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":"63bea608fd98974a5a312ed989a52706c988bfdbb0e401f0928bf7ee4f23d1b9"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","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":"e8a65772ec286ace14c647cf4c57905a48ec93085118665b077468b3400d9098"},"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":"28321f7abfc25a61a40515664e3332de05542e0b57aeb42683d5cd57b7109343"},"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":"4ec268c6d6b43a9a29a68676ed386168311a704c5619e44bfbe000df873e43ba"},"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":"f56e237c1615ef15bd25adbe4b62a14568e866c47523518503eca48388aec88a"},"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":"7bf629e53a58a6e8c6ea3c1b54463dd8d89e42c347f53df6311eb20303af2662"},"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":"e9b14c77c8654ad5b6877791d9ec656b7de50849dc0e61a933731953ea9a667d"},"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":"18f93e03e0238941543594bf1abe5760e91aad27f9057181c836116bde690bfd"},"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":"1db7ef129240333af188b96ade1b1b9fe81897b808105f354f7a45e0f55153b5"},"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":"5bbd6a78410cd1604a2666f80c6dd12df6b59ae6a077032d02d0c2e897507210"},"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":"74186827028527540cc6340c36de4ed3fbfdd16d408e8b8f2c60ace4e12fb960"},"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":"7541d272211206d1c4ce4540b0b794dcfafc2f4033edf2c4f9aefa095ac519d0"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f898d52d421327393874d4576c03d90a80f97651fe5aa4c624956d9d2340c357"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"004d06f492d14d315a6c8cf5a9b52234a2a5b115c76c73ce01be24b517fe37c0"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccacb646ede10197ae5fbaac0e08565aaf2863ceedcd76f0ec217473572ad55d"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"direct","declaredRange":"4.0.7","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86f7f4f43d3bc6491aff8cb13793be035d04e75831573655ec6a20cd34e4df5e"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"direct","declaredRange":"4.0.7","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50606757435894726b8523f3349ba832d9de82ba65d7fdd2452056aac57962c0"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"direct","declaredRange":"4.0.7","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32fecf8c508fd4582d9cc2d056189b087694a66734fd043c4e69a8af18f6e85b"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76dd7ea364ab5c728f742ae2e93025fb406420f1544ca23e9e7ca04b1dfa50eb"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c624cd727ea7e56103092667b7f5ef4d88b636cf50b91af2b9e269401548689"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4379bfcc7061ac8d57b952362a324f3b312a0e245c738c38818cf95ae77fcab9"},"properties":{"dependency":{"package":"picomatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","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":"9d8a53502446f549c76161079af9f1d16167d7f17055de745ec45200309f79f6"},"properties":{"dependency":{"package":"decimal","version":"3.1.1","advisory":"EEF-[CVE redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"3.1.2","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":"10ba51a7f903a9e107bbb4bc0cbedffc82b62496e09621b8f705a6936f0e8a96"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"direct","declaredRange":"=0.4.45","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":"cc74785b017a8769f65490d2368c8170c60fa0a8586fe5259b3f0943200473b4"},"properties":{"dependency":{"package":"chrono-tz","version":"0.10.4","advisory":"RUSTSEC-2026-0555","severity":"medium","relation":"direct","declaredRange":"=0.10.4","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":"f5ef084a2f78f6d7fe5c818848e16b2d7ad016043ab7632a1764db42963c22ee"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"9ef71f4073a875423ba5c3454ae1dd1e0d75070b5ef03b8577f48f564d232813"},"properties":{"dependency":{"package":"ip-address","version":"10.7.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"10.7.4","relation":"transitive","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":"5b23caffa8e3e358e638a0c545988f840a4a1da9b07759988da4171aaac37a51"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"315cafd29b06e3b1f2344855208bfbbc1ab8dc6e6110dd1bed16102d2ae6dd26"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3761baceb85cc47302e395f2008ae214340f07fd41a875328e804fb07b457c5d"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"e1f177abbbd00314e13f8e0d8d0a5bccf11f5a3e8b5a5c57b0f2b2c33b75162d"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"3c91332e44e8a931557396b2c500348b6ddc87da880c4c58e4e587d91722da8f"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e318cc0d29137ca2671628ecff85a84e5b5ae3fb20a852492771ec5f8fd50b58"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"separate-copy","declaredRange":"11.0.8","reachability":{"kind":"production","file":"src/commands/script-loader.ts","line":204}}}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"926693c94c5dfc4af2ee89189df006894cc5ab3edc02bce79645867b6eacf3a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adad4c2f0e9deac654a7a7c7c13320984e5b789ac0c4a87d6938d7c253311d50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0eb0a3b1ee91e5f909e0714c7bfb0c7d825788fc2414437ae0b98e3c6e91282c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56128ba8b64b7f25df2bbec038828fd35b63675dc05a00bde01702e2dc41e5fe"},"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":"fa586759ad908bc81e937525c8d2775674a86cbe1fc72b54bdd94439d8790878"},"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":"d32cf8c861270f258d574b0f01ad8dc0cc5f6d75f4595c6062db89b3ac50b624"},"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":"c046b17c879c186ae4b1859b230b04cfa9e8be787c28d4745f4d2ea97e6aa93f"},"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":"4d2149c0790923aab7c9c525ffa95747b4128e2084e01ee9f60d86b0434b4dcb"},"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":"dc9780fd9d98a69a2db0a622954731cf4fc2932df9d2eaf8425fb811947eba52"},"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":"4cb1d5accb429dca9617c5ff839a23820fcab37ad6d03b299e22f05df73a1837"},"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":"903c46fd9fee5e1279dcac8266020d8811d9fa0e6692bd6d506f5848d66f6995"},"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":"66e190a8073d5b155569101ebd29a1fa30dc7025022078a266afce382b44afd3"},"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":"6b7418247142e8d6a677f3a74382beed5d6cfe0fa102ba9eea0d408895335bf9"},"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":"e1c077683c9059889cc71ce840ae34c369e32456ff49b580b51d58ca75a2172c"},"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":"22d332dcccf6ffa71dab6c6dca690b5d5bcabd8e41998dfc41a14c2f16a82531"},"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":"a139a8db8e47199e55e40d82e3860be76822461ff7079ff9c90d2b5653c3a298"},"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":"ad6289949eb848086206f82faf98ac25740e893f7b6540f9e4232cd2d11047e2"},"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":"D35","level":"warning","message":{"text":"Change coupling: child-processor.ts \u2194 sandbox.ts: \u0060src/classes/child-processor.ts\u0060 and \u0060src/classes/sandbox.ts\u0060 change together 57% of the time (13 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00607dd064ec\u0060 fix(sandbox): kill children that fail init and surface refusal errors\u2026; \u0060ec420d1b\u0060 feat(sandbox): add getDependencies proxy for sandboxed processors (#3\u2026; \u0060cbfe437a\u0060 feat(sandbox): add getDependenciesCount proxy for jobs (#3923) ref #3\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/child-processor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199605f44072f1028aea4701b04d8418610fb86ae0e7e09dee391cc80c7a4b52"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX3","level":"error","message":{"text":"Namespace dependency cycle: The namespaces BullMQ \u2194 BullMQ.Redis depend on each other. The lightest dependency in the cycle is BullMQ \u2192 BullMQ.Redis (BullMQ.RedisBackend \u2192 BullMQ.Redis.RedisConnection, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3fa6765ca46f89049569ac9691ec9746fa3321da9cc0348e3ee55ef0a90cbb"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: IQueueBackend (67 members): \u0060IQueueBackend\u0060 declares 67 members: \u0060WaitUntilReadyAsync\u0060, \u0060CloseAsync\u0060, \u0060DisconnectAsync\u0060, \u0060Closing\u0060, \u0060SetNameAsync\u0060, \u0060ForQueue\u0060, \u0060MinimumBlockTimeout\u0060, \u0060Capabilities\u0060, \u0060QualifiedName\u0060, \u0060Keys\u0060, \u0060ToKey\u0060, \u0060ClientName\u0060, \u0060AddJobAsync\u0060, \u0060AddJobsAsync\u0060, \u0060AddFlowAsync\u0060, \u0060MoveToActiveAsync\u0060, \u0060MoveToCompletedAsync\u0060, \u0060MoveToFailedAsync\u0060, \u0060MoveToDelayedAsync\u0060, \u0060MoveToWaitingChildrenAsync\u0060, \u0060RetryJobAsync\u0060, \u0060ReprocessJobAsync\u0060, \u0060PromoteAsync\u0060, \u0060MoveStalledJobsToWaitAsync\u0060, \u0060RetryJobsAsync\u0060, \u0060PromoteJobsAsync\u0060, \u0060PauseAsync\u0060, \u0060DrainAsync\u0060, \u0060CleanJobsInSetAsync\u0060, \u0060ObliterateAsync\u0060, \u0060RemoveAsync\u0060, \u0060ExtendLockAsync\u0060, \u0060ExtendLocksAsync\u0060, \u0060UpdateDataAsync\u0060, \u0060UpdateProgressAsync\u0060, \u0060ChangePriorityAsync\u0060, \u0060AddLogAsync\u0060, \u0060GetStateAsync\u0060, \u0060IsJobInStateAsync\u0060, \u0060GetJobDataAsync\u0060, and 27 more. Counted as the author wrote them \u2014 a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/IQueueBackend.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9030f9f704618c9398b4616f568b22c84f62fdeeab7ee5786ca8416ffdbba9"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: IRedisClient (44 required operations): \u0060IRedisClient\u0060 declares 44 required operations: \u0060connect\u0060, \u0060disconnect\u0060, \u0060quit\u0060, \u0060duplicate\u0060, \u0060on\u0060, \u0060once\u0060, \u0060removeListener\u0060, \u0060off\u0060, \u0060emit\u0060, \u0060setMaxListeners\u0060, \u0060getMaxListeners\u0060, \u0060removeAllListeners\u0060, \u0060defineCommand\u0060, \u0060runCommand\u0060, \u0060multi\u0060, \u0060pipeline\u0060, \u0060hgetall\u0060, \u0060hget\u0060, \u0060hmget\u0060, \u0060hset\u0060, \u0060hdel\u0060, \u0060hexists\u0060, \u0060get\u0060, \u0060set\u0060, \u0060del\u0060, \u0060zrange\u0060, \u0060zrevrange\u0060, \u0060zcard\u0060, \u0060zscore\u0060, \u0060lrange\u0060, \u0060llen\u0060, \u0060ltrim\u0060, \u0060lpos\u0060, \u0060smembers\u0060, \u0060xadd\u0060, \u0060xread\u0060, \u0060xtrim\u0060, \u0060bzpopmin\u0060, \u0060info\u0060, \u0060clientSetName\u0060, and 4 more. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interfaces/redis-client.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b750bdf9f452d0c868df5fe800193db65a99e937784c41d873f65211c3d8c6"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: IQueueBackend (85 required operations): \u0060IQueueBackend\u0060 declares 85 required operations: \u0060waitUntilReady\u0060, \u0060close\u0060, \u0060disconnect\u0060, \u0060setName\u0060, \u0060on\u0060, \u0060once\u0060, \u0060removeListener\u0060, \u0060forQueue\u0060, \u0060toKey\u0060, \u0060parseNodeKey\u0060, \u0060clientName\u0060, \u0060addJob\u0060, \u0060addJobs\u0060, \u0060addFlow\u0060, \u0060addJobScheduler\u0060, \u0060moveToActive\u0060, \u0060moveToCompleted\u0060, \u0060moveToFailed\u0060, \u0060moveToDelayed\u0060, \u0060moveToWaitingChildren\u0060, \u0060moveJobFromActiveToWait\u0060, \u0060retryJob\u0060, \u0060retryFinishedJob\u0060, \u0060promote\u0060, \u0060moveStalledJobsToWait\u0060, \u0060retryFinishedJobs\u0060, \u0060promoteJobs\u0060, \u0060pause\u0060, \u0060drain\u0060, \u0060cleanJobsByState\u0060, \u0060obliterate\u0060, \u0060removeOrphanedJobs\u0060, \u0060extendLock\u0060, \u0060extendLocks\u0060, \u0060updateData\u0060, \u0060updateProgress\u0060, \u0060addLog\u0060, \u0060clearLogs\u0060, \u0060changeDelay\u0060, \u0060changePriority\u0060, and 45 more. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interfaces/queue-backend.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8934030a46e37b49f7cb13614e2974caca32b36e933ee16f0ffeab5dfda244c"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: IRelayBackend (20 required operations): \u0060IRelayBackend\u0060 declares 20 required operations: \u0060waitUntilReady\u0060, \u0060close\u0060, \u0060registerNode\u0060, \u0060heartbeat\u0060, \u0060unregisterNode\u0060, \u0060sweep\u0060, \u0060subscribe\u0060, \u0060removeEndpoint\u0060, \u0060publish\u0060, \u0060deleteRetained\u0060, \u0060readInbox\u0060, \u0060trimInbox\u0060, \u0060getCounts\u0060, \u0060getNodes\u0060, \u0060getSubscriptions\u0060, \u0060getPatterns\u0060, \u0060getRetained\u0060, \u0060getNamespaces\u0060, \u0060getNodeConnections\u0060, \u0060interruptInbox\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interfaces/relay-backend.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42a0a78f671273abc2880e4260bcfd5138628078cc2e97c88bab564c9584d04"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: NodeRedisRawClient (48 required operations): \u0060NodeRedisRawClient\u0060 declares 48 required operations: \u0060on\u0060, \u0060connect\u0060, \u0060destroy\u0060, \u0060quit\u0060, \u0060duplicate\u0060, \u0060scriptLoad\u0060, \u0060evalSha\u0060, \u0060eval\u0060, \u0060multi\u0060, \u0060hGetAll\u0060, \u0060hGet\u0060, \u0060hmGet\u0060, \u0060hSet\u0060, \u0060hDel\u0060, \u0060hExists\u0060, \u0060get\u0060, \u0060set\u0060, \u0060del\u0060, \u0060zRange\u0060, \u0060zCard\u0060, \u0060zScore\u0060, \u0060zAdd\u0060, \u0060zRem\u0060, \u0060lRange\u0060, \u0060lLen\u0060, \u0060lTrim\u0060, \u0060lPos\u0060, \u0060lPush\u0060, \u0060rPop\u0060, \u0060sMembers\u0060, \u0060sAdd\u0060, \u0060sCard\u0060, \u0060xAdd\u0060, \u0060xRead\u0060, \u0060xTrim\u0060, \u0060xLen\u0060, \u0060xRevRange\u0060, \u0060bzPopMin\u0060, \u0060info\u0060, \u0060clientSetName\u0060, and 8 more. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/node-redis-client.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e30ceee3c8964be052930ff7d6417a0ec1efa4343df4c7cbf27a55d711b945d"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: QueueEventsListener (18 required operations): \u0060QueueEventsListener\u0060 declares 18 required operations: \u0060active\u0060, \u0060added\u0060, \u0060cleaned\u0060, \u0060completed\u0060, \u0060deduplicated\u0060, \u0060delayed\u0060, \u0060drained\u0060, \u0060duplicated\u0060, \u0060error\u0060, \u0060failed\u0060, \u0060paused\u0060, \u0060progress\u0060, \u0060removed\u0060, \u0060resumed\u0060, \u0060retries-exhausted\u0060, \u0060stalled\u0060, \u0060waiting\u0060, \u0060waiting-children\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/queue-events.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"801ad2145be1babd715a88b532d12df29299f7da91d2fb4c6be2459096958d87"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Backend (58 abstract methods): \u0060Backend\u0060 declares 58 abstract methods: \u0060waitUntilReady\u0060, \u0060close\u0060, \u0060disconnect\u0060, \u0060setName\u0060, \u0060forQueue\u0060, \u0060minimumBlockTimeout\u0060, \u0060capabilities\u0060, \u0060qualifiedName\u0060, \u0060keys\u0060, \u0060toKey\u0060, \u0060clientName\u0060, \u0060addJob\u0060, \u0060addJobs\u0060, \u0060addFlow\u0060, \u0060moveToActive\u0060, \u0060moveToCompleted\u0060, \u0060moveToFailed\u0060, \u0060moveToDelayed\u0060, \u0060moveToWaitingChildren\u0060, \u0060retryJob\u0060, \u0060reprocessJob\u0060, \u0060promote\u0060, \u0060moveStalledJobsToWait\u0060, \u0060retryJobs\u0060, \u0060promoteJobs\u0060, \u0060pause\u0060, \u0060drain\u0060, \u0060cleanJobsInSet\u0060, \u0060obliterate\u0060, \u0060remove\u0060, \u0060extendLock\u0060, \u0060extendLocks\u0060, \u0060updateData\u0060, \u0060updateProgress\u0060, \u0060changePriority\u0060, \u0060addLog\u0060, \u0060getState\u0060, \u0060isJobInState\u0060, \u0060getJobData\u0060, \u0060getJobLogs\u0060, and 18 more. Counted over its \u0060@abstractmethod\u0060s (and abstract properties), once per name; concrete methods are helpers an implementer inherits, not a burden, and \u0060_\u0060-prefixed members are not counted. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backend.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69eb1bc5b6e5ac1008d466518d8ebe53c1af3647f872416df990488629bc5c"}},{"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":"M4","level":"note","message":{"text":"README/code drift: docs/gitbook/guide/relay/backends.md names Redis 5, but the manifest declares \u0060redis\u0060 6.3.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/gitbook/guide/relay/backends.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afbbf77bba643267d772c0610272afa82d38902ac10e5284f771e55d4983633"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.JobScheduler\u0060 (dotnet/src/BullMQ/JobScheduler.cs:14) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/JobScheduler.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"302aefe1dfe259ace0484377a3d6aa0780fcaabe2245cadb56e90232b5ab1c09"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.KeepJobs\u0060 (dotnet/src/BullMQ/Options.cs:187) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Options.cs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"732d84c2421535097d0cfd658f114ccaceca0780c528d42c5cd758d9662a7b46"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.Postgres.PostgresConnection\u0060 (dotnet/src/BullMQ/Postgres/PostgresConnection.cs:45) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fee4f4e589626adc0b2734f7175e84af17b94b3988121809a0e3cd0aac8e3d5"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.Postgres.SqlLoader\u0060 (dotnet/src/BullMQ/Postgres/SqlLoader.cs:15) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/SqlLoader.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6962600d9ca193b63f1cfaa32a0732940b8ea895f85e38103a9b785b4412f8a0"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.Redis.LuaScripts\u0060 (dotnet/src/BullMQ/Redis/LuaScripts.cs:18) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Redis/LuaScripts.cs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a51cf74c9e37a5fa7a604c10cc250cbb2c19cbcf47f9e497095c824ea3e5297"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060BullMQ.Version\u0060 (dotnet/src/BullMQ/Version.cs:4) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060BullMQ.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Version.cs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f532b783ce96e2a9dc9ea0bc91857af4c777ebc8c2312bc9cef6e31d5208e0"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/cluster.test.ts\u0060 removes 23 test(s) in 1 file(s) (e.g. \u0060tests/cluster.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b49741d9017ddddc8d430411a84fd40c76463de246afa9f1ef08ada07cb21ce"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/connection.test.ts\u0060 removes 53 test(s) in 1 file(s) (e.g. \u0060tests/connection.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f84e46fd75afac53403df3c8fbb927d330cde3e9b663c58afea65317b0137b"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/sandboxed_process.test.ts\u0060 removes 52 test(s) in 1 file(s) (e.g. \u0060tests/sandboxed_process.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce371bc099a614a2870dd9357ac1708aa470aeb96d1d8f6fe15b4142fa0944"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/worker.ioredis.test.ts\u0060 removes 2 test(s) in 1 file(s) (e.g. \u0060tests/worker.ioredis.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b9f2f700845dde36fc5e67205afbf844fa5335d174cd2bab28147b0e92a0a1"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/relay.ioredis.test.ts\u0060 removes 24 test(s) in 1 file(s) (e.g. \u0060tests/relay.ioredis.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87f66c8348f6259fcb60dbc30eabf4535b7bb940d2649e7977eb384bd8b4e36"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/node-redis.test.ts\u0060 removes 22 test(s) in 1 file(s) (e.g. \u0060tests/node-redis.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0394af574e18dd4bfd85d23121cc579eda9518f82cd090c04444da45fb23db"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/adapter-conformance.test.ts\u0060 removes 68 test(s) in 1 file(s) (e.g. \u0060tests/adapter-conformance.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1036f8f8f9f71b63b38fc821f38a6d42d13e502574624abd62644c807422a019"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/bun-redis.test.ts\u0060 removes 13 test(s) in 1 file(s) (e.g. \u0060tests/bun-redis.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5ad52f0c1bedd8ac27e85911b0cb798f3f7ad14ccaad61771e5a76f5d92cfb"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/bun-adapter-suite.test.ts\u0060 removes 6 test(s) in 1 file(s) (e.g. \u0060tests/bun-adapter-suite.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1595ecc2e6aa451d48b2ec0950212c38378377c7e013d95c7cee164b9ae328"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060tests/postgres/**\u0060 removes 76 test(s) in 7 file(s) (e.g. \u0060tests/postgres/migration.test.ts\u0060, \u0060tests/postgres/operations.test.ts\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e74aae55a25998a117349444b89085591df8e5a8b170f32926171297c459fb6"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: Deployment is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever reaches the release trigger goes to production unreviewed, so a mistaken merge or tag is live before anyone can stop it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by a CREATE TABLE statement outside the migrations: This repository evolves its schema with versioned migrations, but a CREATE TABLE statement here creates schema at runtime outside them \u2014 structure no migration created and the migration history does not describe, so a later migration that touches it fails on a fresh environment and the environments drift apart. Create it in a migration instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbec1473911a686f4d49a970f35ae9354c2a50dba426eecc83d72e8bcb22409"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060transpileScripts\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generateRawScripts.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee12e4389e71d0708f07cfac0b6a230bc07d8875f3049757854bbaa5076952d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060transpileScripts\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generateRawScripts.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cdaf4a7bc7da799770795c8f744dadd5e38b1f91d37d924354a9a1ca29647c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await OpenWithRetryAsync().ConfigureAwait(false)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"93658745c4d3376236259c7569971f1c307bcdc9569441bb6adbe2800714c9d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await conn.BeginTransactionAsync().ConfigureAwait(false)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc3eea8b2235ebf9b194c36895e6fa1cf5d7a304d23f4dd5d20fab65793a2d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand(\u0022SELECT current_setting(\u0027server_version_num\u0027)\u0022, c...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e9055f99db96afaa23eeeebb1cf326c137d3aed38ea8276f0fab709df0d470"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand(\u0022SELECT pg_advisory_xact_lock($1, hashtext($2))\u0022,...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd310ca1040346317fe8827b87997b72043628e067bcb0d61dcdf9c8f28ad5ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand( \u0022SELECT COALESCE(MAX(version), 0)::int FROM bull...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"44455c870697f20c25f6c9f58ce21ed95c100b8bda7838637b73de7c8b678669"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand( \u0022INSERT INTO bullmq_migration (version, name) VA...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e84685022fb2984b15ea8cd341990e42f2d03542fc13d1bb9ed43ff1221650"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand(sql, conn, tx)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8467de3acdbdf7761b4c31aa53366566d7bb41e0862740068a8c9de134ece"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand(sql, conn)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7f4f0de87b901724a6d74389d232defea83632b724965babb9238ed2e9d75a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await cmd.ExecuteReaderAsync().ConfigureAwait(false)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa83278779ec68af4658b4944f781c14016f00475ed1a3a60b2c2dc2b949f52"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand( \u0022SELECT set_config(\u0027application_name\u0027, $1, false...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2f5a79354f60a467ee2461c0deb2cb2490b89f55117c37757f151af33a33b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand($\u0022LISTEN {JobsChannel}\u0022, _listenConn)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78a2e86cf8f1763b214ec9f6de4151a845adab57c36340a77ae57647067bbc7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand( \u0022SELECT set_config(\u0027application_name\u0027, $1, false...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d68a0dcadbf741b3743c1e6d7c724e6e0e633cf510af70e39baea804b86df6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new NpgsqlCommand($\u0022LISTEN {EventsChannel}\u0022, _eventsConn)\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/PostgresConnection.cs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14e9dbc31a89613b99b4b1da729d05f119d944cbc787ac92a418705b2445b5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (11 clone groups): 11 duplicated blocks under src/ have copies in at least two of the sibling directories classes, interfaces, postgres, utils \u2014 5 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-relay-backend.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b588bbab0fd83e7e9c977d6c22f49b416054df5e238be6c79f27b6d3aa876"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2 locations): src/postgres/postgres-queue-backend.ts:812 \u00B7 src/postgres/postgres-queue-backend.ts:880 \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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db5369eec5d22512e9b571374488ddd6104c549a1d4ac4ac93f35697f790f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:938 \u00B7 src/classes/valkey-glide-client.ts:861 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81963abf59804b8f1d780466e4b0bb2c7e5a8f760b3fb81b4e557cb316ebc43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): src/classes/redis-relay-backend.ts:140 \u00B7 src/postgres/postgres-relay-backend.ts:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 152 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":"src/classes/redis-relay-backend.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"353260c4432062004fc9515ab9bc9c30320bd09d84bb48bd4fce6aedb474aae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/classes/queue-events-producer.ts:19 \u00B7 src/classes/queue.ts:163 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/queue-events-producer.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47027ff9210088b2b2a86e550bcd4e5f4916e09a30749fe3941bf85b89eb104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/classes/job.ts:422 \u00B7 src/classes/redis-queue-backend.ts:3032 \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":"src/classes/job.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0870ff3e3ced51687cb60b0e8611b5efebe09c8cf655303ad6af51052bf8910"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:597 \u00B7 src/classes/node-redis-client.ts:427 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3122dafd0502f501402446f816b014ccdfe929c59cc75ede3f129b8e194161b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1290 \u00B7 src/classes/bun-redis-client.ts:1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f16e9e40bb5a918b7cf9ebc92f70db1d7c5059314feb2dd74dc1183d3947b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:495 \u00B7 src/classes/valkey-glide-client.ts:619 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe4d84501ea4da297f7889a8c1ffb075492631f5ccf0baa88b40f5216decdb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/classes/redis-queue-backend.ts:496 \u00B7 src/classes/redis-queue-backend.ts:529 \u00B7 src/classes/redis-queue-backend.ts:598 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"428f532a5701b7f4a12a27b72c74fca9da4c1dad590d22d37c383919a1ed58d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/classes/node-redis-client.ts:965 \u00B7 src/classes/node-redis-client.ts:996 \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":"src/classes/node-redis-client.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c6806bd2149b513034194d967bbbd7a386c9d8c079ce330d20dc49092d958"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/classes/queue.ts:263 \u00B7 src/classes/worker.ts:602 \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":"src/classes/queue.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2756c1f6a4246b618f33ab32639b06a5c8b620bb122aa38808edafdabaeb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:298 \u00B7 src/postgres/postgres-queue-backend.ts:360 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9033abc7ad95caae62aae7e653520571bee7e35638514400131c82c3d7ab98af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:1307 \u00B7 src/classes/redis-queue-backend.ts:1782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddd55a4adc1d389dead312e4d3592ad78c9b464fa636bd41cc1b18f4524e91e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/classes/child-processor.ts:243 \u00B7 src/classes/child-processor.ts:269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/child-processor.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"badae685a733d6e40dbddf53c773ab686749c50aa69c43b7b9d9fbd6a3a9079f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/classes/ioredis-client.ts:155 \u00B7 src/classes/ioredis-client.ts:172 \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":"src/classes/ioredis-client.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd34a2ae5b62db5e03b0dc66334a162b9e3f7f35a50ca952daaf8a84981cfca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:921 \u00B7 src/classes/redis-queue-backend.ts:974 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a564700dd806f06ee41499433f60c2b2aab6b05a6e30b5a95bb3aa54ee3c246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/classes/job-scheduler.ts:526 \u00B7 src/classes/job-scheduler.ts:570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/job-scheduler.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b16bc1a86b4eb2b29f043f153defc3b3af4a47ca858aed1705f315b9f27f34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1456 \u00B7 src/classes/node-redis-client.ts:1074 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f88b55cf8f10167ad4bf0e32dbb48108f1888cb2410be6a8bf892a3293ed23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/classes/child-processor.ts:299 \u00B7 src/classes/child-processor.ts:323 \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":"src/classes/child-processor.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"19160a0889f8d6b79e0a7a08bad75673d4bd4f2fb4d60b7f90bd63bb80683d65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/classes/flow-producer.ts:418 \u00B7 src/classes/job-scheduler.ts:213 \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":"src/classes/flow-producer.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd55d4d9b366c59ba1283c999177d1f838975f0a745a9af2551a2259301c506"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:181 \u00B7 src/classes/valkey-glide-client.ts:238 \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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e410a44a5a2480ea76bddf8e50b5181e28bd3ce902d4bf6dcbe019934904605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:793 \u00B7 src/classes/valkey-glide-client.ts:807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/valkey-glide-client.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d4ca918bdecae81c038c1ac6a89f356a7a488e6c44f5b14e4c1a63342f94db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/postgres/postgres-queue-backend.ts:1825 \u00B7 src/postgres/postgres-queue-backend.ts:1839 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ebb1bb226275b20f3deab010a4180d27e1ccc2504adc13ea476ecdce191a8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:763 \u00B7 src/classes/bun-redis-client.ts:1266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f18d00ffbb55d18b0facd25c7fcab5c0363a5f93cae01f234da0ab38addb1ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:845 \u00B7 src/classes/bun-redis-client.ts:870 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5e892e57cea7fc6c87a762397e76d6b7ee30157107c0e01107a9139fd149ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/ioredis-client.ts:376 \u00B7 src/classes/ioredis-client.ts:391 \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":"src/classes/ioredis-client.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd59619ea327a79537ac161d4e444f4c19b81f3d6191871ce7bf9fe1f40836"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/queue.ts:633 \u00B7 src/classes/queue.ts:654 \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":"src/classes/queue.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0c0df600aa97626ecfecb6e58c3fbbc3f314927a36f427dea4449e3ce1b688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/queue.ts:888 \u00B7 src/classes/queue.ts:918 \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":"src/classes/queue.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad2a78d73587aaa38f1c7ab39f6adea84b7a01405deb3db12fc045970e9a87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:734 \u00B7 src/postgres/postgres-queue-backend.ts:670 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b2a8886cf128856a1ff320aa73eaf439f5f5dbd93ff06ee8fbbf75a177007"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:2253 \u00B7 src/postgres/postgres-queue-backend.ts:1901 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89e8f62b5028c968d189fa2103bacb8c096e4eeebc53a859aa56f5695364c5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1362 \u00B7 src/classes/node-redis-client.ts:1043 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f6f025c5095ef66dd142824fb30584f439b320adeda075f02a5201f7aca195"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:1348 \u00B7 src/classes/redis-queue-backend.ts:1390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"764065fc205b56f35c6d21f92461b3bb16b3b9cfadfcbbff30c5f3b32a79da5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:2491 \u00B7 src/classes/redis-queue-backend.ts:2514 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a485fef1062092c76455db473e6f667698afc9216574a1ec25bf052d51662431"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:1164 \u00B7 src/classes/valkey-glide-client.ts:1199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd09cacb506b11e731379ca7c14c1dce3fba1e19fe65bcffece3f046038940"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:862 \u00B7 src/classes/bun-redis-client.ts:885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64e6a999305b9ef04d88b8ba838efe9ec7138d2a7e80cef003f88dc6e26b0ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1375 \u00B7 src/classes/node-redis-client.ts:1056 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9301dc83a0205a94c6cc1995f3bfe3881d90391e2248a01e4c197ef3a6ec2e78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/classes/node-redis-client.ts:502 \u00B7 src/classes/node-redis-client.ts:726 \u00B7 src/classes/node-redis-client.ts:773 \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":"src/classes/node-redis-client.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d946946404f2da2f889edbc8736870cc2ed703e7859e7beb29abaec632953ccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/classes/node-redis-client.ts:602 \u00B7 src/classes/node-redis-client.ts:625 \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":"src/classes/node-redis-client.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbdcfc3115e2257a7f048dafbea7b301d4a05201ec770516e4764c32c1d738a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:2065 \u00B7 src/classes/redis-relay-backend.ts:418 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e02e2a3ef28d3ad751605f26db1abb36e593080b57d0e6edd7bdeb6889caf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:680 \u00B7 src/classes/valkey-glide-client.ts:1317 \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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09d351f3c54cdda576f0e244e40d53b03b8e6cd4aa74d58f2841e629cf362c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/classes/worker.ts:1304 \u00B7 src/classes/worker.ts:1475 \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":"src/classes/worker.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ad6921ee7388b2faf11060d9da5393192ff4b6058d1ed8046a98604483ee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:34 \u00B7 src/classes/node-redis-client.ts:30 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba6003dd2b363f3b475d60025f513bc0305330c6045baf8f75b96106ccb3ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:1749 \u00B7 src/classes/redis-queue-backend.ts:1930 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40c83499a528c69934b1147dbb3ad3cae7d77363ef6d049e6968b989a54761a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/commandTransform.js:12 \u00B7 src/commands/script-loader.ts:476 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/commandTransform.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b354bd57051177cd6cf0e909959f185151768a3630dd58f849b1f190364f024e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/classes/job.ts:1100 \u00B7 src/classes/queue-getters.ts:326 \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":"src/classes/job.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc267db8b0690db8e19e934e6114a57d2f3162133c44df38ffff11b1de70b75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/classes/node-redis-client.ts:562 \u00B7 src/classes/node-redis-client.ts:881 \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":"src/classes/node-redis-client.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ac2740077e99cd1c85f5dd7f99ba5ee6631d05e069a305785941b36083bd42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/classes/queue-events.ts:319 \u00B7 src/classes/queue-events.ts:328 \u00B7 src/classes/queue-events.ts:337 \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":"src/classes/queue-events.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df4ef2ddf7d057191a2099405367b7b3cbcb7b23c497468d80d790edc68b4bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:1334 \u00B7 src/classes/redis-queue-backend.ts:1404 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5afe2fef961b9aaf890948ba0d533b49ad15a0a50469e2b39d330e8db4fe1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:2854 \u00B7 src/classes/redis-queue-backend.ts:2941 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6effa8c8d57c6c629f4959930ba700fa66d74d3283b3e9c577fcf4ae107e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:1256 \u00B7 src/classes/valkey-glide-client.ts:1280 \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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a75683aa9e22700bae77d3fa449e6dbb42cb76fe6884f730bbed3b2503cd91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1004 \u00B7 src/classes/bun-redis-client.ts:1016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f85b7f3a19f75fbec4a6dd963a94dc938f12be33864badb9aad84fa20f60887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:1981 \u00B7 src/postgres/postgres-queue-backend.ts:1039 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"33885336761b9cc89ea00cfff8f3eaeaec4c800d8d7c22c6d81ff0ca60e1ecf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/classes/redis-queue-backend.ts:2702 \u00B7 src/classes/redis-queue-backend.ts:2721 \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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"406334fa177516f68dc4e2918ff43195d93922e2a4a18bf04584084f62e1bc51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/classes/valkey-glide-client.ts:153 \u00B7 src/classes/valkey-glide-client.ts:276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/valkey-glide-client.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3ab2751622f0aec3eea32c517cf52410536be934a2ceb61040cd0d025b5507"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:832 \u00B7 src/classes/valkey-glide-client.ts:776 \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":"src/classes/bun-redis-client.ts"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cf2167b348f114af7c5736b2a912592abc27b5a34bb7f70b4b7755b22ca2f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/classes/bun-redis-client.ts:1341 \u00B7 src/classes/bun-redis-client.ts:1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"78095d7c0d1e48bd376b1f4a4539db260ec6949e9e7f78b427bd8ae07a6fbe3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/classes/ioredis-client.ts:35 \u00B7 src/classes/ioredis-client.ts:41 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/ioredis-client.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"623763127feadea12a83522ec4680cf460c6fbc6444ba6a289cddb3884009409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/classes/queue-getters.ts:347 \u00B7 src/classes/queue-getters.ts:366 \u00B7 src/classes/queue-getters.ts:384 \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":"src/classes/queue-getters.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ac01c1a6ba65f5b788d1b262022fde276f4b84425e9ccede72298b15d2b945"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: vitest.postgres.global-setup.ts:15 imports tests/postgres/utils/postgres-url.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.postgres.global-setup.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a3ffdbc7b0ff76dff17c2dad5ad59af26dedf9127ac7e103ee14a22c31a045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeImmediately (cyclomatic 102, cognitive 128): executeImmediately has cyclomatic complexity 102 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/valkey-glide-client.test.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0aad4a3ed9eeb6b6af6c10690f0dba8e5c61fdee9a72fc4a1ca8e782d379f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 24): constructor has cyclomatic complexity 24 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":"src/classes/relay.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bbd46c0e1bd65c3044e800cd8fb70920619bd6373f01b5186ba41ac73f2f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addJob (cyclomatic 24, cognitive 20): addJob has cyclomatic complexity 24 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4532203844819b27804e18a8e96279e6b5f9b711439f18dc7b6194062e413391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toBatchEntry (cyclomatic 20, cognitive 15): toBatchEntry has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa23000e59e63b6a37e103f007f8dcbf58803b90049233511ce7e6ea1add4da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRedisVersionAndType (cyclomatic 18, cognitive 33): getRedisVersionAndType has cyclomatic complexity 18 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1469c4ed5d65b811c2ce1fe9600bafcedb2e28f1910ab8b3d5d9428612bc72ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToJobJson (cyclomatic 18, cognitive 17): rowToJobJson has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e3be71a9ae2f3be471a0d102109535554234dd5333c161745405899536afec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connect (cyclomatic 17, cognitive 18): connect 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":"src/classes/bun-redis-client.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4581e53aec2d1d65d3a01bb63f265f6cf03971d1c324ea98f1d712badb40aead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDependencies (cyclomatic 16, cognitive 34): resolveDependencies has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/script-loader.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc961f6963d65cc94dcc8e0376404ffcda722f2ab610d830430c3af3e0110427"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDependencies (cyclomatic 16, cognitive 15): getDependencies has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a84ad1fe51dbfb3c87b14be33b988c9f4f889d6a6fea63653f4386263757a87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapSchedulerRow (cyclomatic 15, cognitive 16): mapSchedulerRow 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5549050ebf2197ba1f7ec10986fd84494381bde8590b0b3b06f774669c7de7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeOrphanedJobs (cyclomatic 14, cognitive 30): removeOrphanedJobs has cyclomatic complexity 14 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea5890beff356579fa870b3769f540389b9264b4c799426005ce552c15adbb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 28): (anonymous) 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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0203b451f87a10ad6fa9ee86f7e09eee8b43214eaf49d3892e72323a8bc92496"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/job-scheduler.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"078340336237c6d1f7cbe48ad70710f948175df9b8a395f5c93f4ce9cf60c798"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadScripts (cyclomatic 14, cognitive 16): loadScripts 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":"src/commands/script-loader.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfffdfe97073d5a1614fd523cbc6f4b033e15f1649e5bfbc4f40aab4119f1f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isIRedisClient (cyclomatic 14, cognitive 13): isIRedisClient has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/ioredis-client.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb29d48394b92347aa107dec8a05ab5162143df6a2c4f4d840eeee67ad6529af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDependencies (cyclomatic 13, cognitive 19): getDependencies has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f62c6e1b5d70764bcc3ed511ce27dbe2b691068120cb0e1b641ff76915b90c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readInbox (cyclomatic 13, cognitive 15): readInbox 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":"src/classes/redis-relay-backend.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8b1447a8ea2241997a3b089dae333f2d5de84792e633fd48f33090625c9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLoop (cyclomatic 12, cognitive 23): readLoop has cyclomatic complexity 12 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":"src/classes/relay.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"345d2f0b49ff0b55d5917d117f6a08b5d353ea9ca46e78f6e63e4ca5beb6a526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paginate (cyclomatic 12, cognitive 17): paginate 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5728ce33f5354bbe7e4ca959ca3eb34b8102003a2a81d674b9870d2c8f20e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToCompleted (cyclomatic 12, cognitive 12): moveToCompleted 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a009de9d79a7d6635741d771b487f42b1804a96e83c5b8b6e2b50588a66b6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToFailed (cyclomatic 12, cognitive 12): moveToFailed 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"032998049730ab1d48f16dff205a3b8cc9c78984f620abcb25186924ce58daf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToDelayed (cyclomatic 12, cognitive 12): moveToDelayed 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"43245fda255191f179daf2def4f6f40699bf8a2ca48c79f47e8a10079dc7fbe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJobInState (cyclomatic 12, cognitive 9): isJobInState has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f2dada47df7e4b9347162641b19277dfa25bc8d578f4afa641891a4457bad4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCommand (cyclomatic 11, cognitive 21): runCommand has cyclomatic complexity 11 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":"src/classes/node-redis-client.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e81f21badc481fd2758ecb8a835dcbf783fb026870b122c24ca16865aeabb58"}},{"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":"tests/relay.ioredis.test.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"db92c3e57dc5799b37b31c894339bb1fd01e218e4ecae1c110870d9f7c28f0d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referenceParse (cyclomatic 11, cognitive 15): referenceParse 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":"tests/relay.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de1eeecf065010f66ce038705fa86017051e40bb320fa4f1b0ec58887f0089"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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":"src/classes/flow-producer.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3280f362290f64e69746818941129139faecb987645ca3f11c60970a62bf27bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addJobToTransaction (cyclomatic 11, cognitive 11): addJobToTransaction 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"98252feb4b864a39a231ec1218403e7dfa3558849d82de55053988b0a528404f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/postgres/operations.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd6616fe4b466557a1c667a1c7aac8600a984ebea83dda307f1f1baac1a6fe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/redis-queue-backend.ts: 2766 lines of code: src/classes/redis-queue-backend.ts has 2766 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":"src/classes/redis-queue-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcf8e3e8e8d8b715d360c010a85fc90b52474395226327b4eb309a245772022"}},{"ruleId":"R3","level":"warning","message":{"text":"src/postgres/postgres-queue-backend.ts: 2131 lines of code: src/postgres/postgres-queue-backend.ts has 2131 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":"src/postgres/postgres-queue-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d098cca7b8471b639c80bdb8149c5214a594d3430d1b498d8fda9b41299ff7b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/worker.ts: 1487 lines of code: src/classes/worker.ts has 1487 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":"src/classes/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1444f5cc44d1edae4cd147cec5abe42be786eccf8be94be21988db113b031d81"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/bun-redis-client.ts: 1329 lines of code: src/classes/bun-redis-client.ts has 1329 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":"src/classes/bun-redis-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"224419ad6865591304f9f2122e14d7fde1c66bb03d52b6fd9080652ec559ef68"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/job.ts: 1265 lines of code: src/classes/job.ts has 1265 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":"src/classes/job.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b29c72514cf36953816202f064bdda2bbfe044b5f4d9cbb25c5dabfdccd49d1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/valkey-glide-client.ts: 1144 lines of code: src/classes/valkey-glide-client.ts has 1144 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":"src/classes/valkey-glide-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"422577c2146c57ff01d7bd1ce99134e35eaa81ab091de550c01f29feb8210ab4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/node-redis-client.ts: 975 lines of code: src/classes/node-redis-client.ts has 975 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":"src/classes/node-redis-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725ba41ef2be4ae89a22d941e1748754d113da3cd1efda91fb79bb338b2803e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/queue.ts: 900 lines of code: src/classes/queue.ts has 900 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":"src/classes/queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c900ac98fd614ec552f8dbe11d6f800b5b47f257c4e50d176d196b43ecc408"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/redis-connection.ts: 798 lines of code: src/classes/redis-connection.ts 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":"src/classes/redis-connection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c5964622d4fcf1f1985c66e93f913b7937fc034a133c66adca6faf6fd2ccd7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/interfaces/queue-backend.ts: 708 lines of code: src/interfaces/queue-backend.ts has 708 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":"src/interfaces/queue-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6557f7ac6c8efdef057026d71815ed604c00830a9a5a62af1d58e4e4f90fa138"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/relay.ts: 701 lines of code: src/classes/relay.ts has 701 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":"src/classes/relay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a59ceca8ef22db270e79e9f9186b2cd74642a7a4b1bdde2983c8910a5861c5d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/queue-getters.ts: 664 lines of code: src/classes/queue-getters.ts has 664 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":"src/classes/queue-getters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6271fcc78e96843c95f0ae86a92ee9a3ae682d88d7d7b34935ae95a9a49b7b8c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/flow-producer.ts: 643 lines of code: src/classes/flow-producer.ts has 643 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":"src/classes/flow-producer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37423d5668c6541298fd9d8da37b004c724c77388bff84a3ae820a5810f7d9c9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/script-loader.ts: 573 lines of code: src/commands/script-loader.ts has 573 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":"src/commands/script-loader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ad911f491bc821ea57787ff1dc06b942ffe1f026029699f3bbb492437af39d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/redis-relay-backend.ts: 570 lines of code: src/classes/redis-relay-backend.ts has 570 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":"src/classes/redis-relay-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7200a7962704f265b111da765c53ed11fb0a99f9cd76e73370e38b86b86e2fe0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/job-scheduler.ts: 504 lines of code: src/classes/job-scheduler.ts has 504 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":"src/classes/job-scheduler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd81d04b88f9e00f0be91f2b45f01e3143e31eca7ce8b65c9903a148ed30023"}},{"ruleId":"R3","level":"warning","message":{"text":"src/postgres/postgres-connection.ts: 473 lines of code: src/postgres/postgres-connection.ts has 473 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":"src/postgres/postgres-connection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"121739bb60312ba1f27c2e55adac9cb41b998fed9f3709b0eea0b68876e82376"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils/index.ts: 445 lines of code: src/utils/index.ts has 445 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":"src/utils/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea329b3c8b17e54d20d1abdbdafd8dfac32678fb4003518607ff71873c188831"}},{"ruleId":"R3","level":"warning","message":{"text":"src/postgres/postgres-relay-backend.ts: 432 lines of code: src/postgres/postgres-relay-backend.ts has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/postgres/postgres-relay-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7643d9f9be703ee730d5749eb5147da438d2691a62dcbc641e6e8cfe5ef765a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/classes/ioredis-client.ts: 410 lines of code: src/classes/ioredis-client.ts has 410 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":"src/classes/ioredis-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265bfe5ae476d2ef2b7beab3a2c1738ddd2b1a1f579d8777c127fe055d968966"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/scripts/updateVersion.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e164717a61bff8ce4243dc7897ca543b9093f97bf30fe63652a35f586a893e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/scripts/updateVersion.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f038bfbae7df51b3f2100589e656c07661d3b74bbdc04c0aa328d6b377805fd1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.postgres.global-setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f3011c8489a9e2ec75bf7c50135fb346ebe4031b9d6d1037e88699ffc5a0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/main-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3f6f1f570266c0c97ceee6b1b915d246e70f8fe0d951119e3bdde59d7cfab3"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~486 LoC): This script imports the product (\u0027../src/classes/relay\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under benchmark/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node benchmark/relay-benchmark.ts\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmark/relay-benchmark.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5694e42654cd55c1e3b796606255c6fb9a5db94891ea633367038efeeebe6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClusterNodeWithClientCommand\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/queue-getters.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34b908e0861c7b67bfe0aa86d65c7cedb43e004f5e234949b0c051eb0cfbaf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FlowRootParentJobOpts\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/interfaces/flow-job.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1511a7891f80d13affd5653b05f65600f594ff5d3491ad69f77853343d7a1a86"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027acceptsArbitraryConnection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types/backend-connections.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b87bca5c53798f79df1edad4324cde22c7cb9db3045a4776ffa1293107de2a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TypedQueue\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types/constructor-options.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d887f95889effd8c33e0ed8453d886c3a69e633be77246fdff5df19a5122a9"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@valkey/valkey-glide\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/valkey-glide-client.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc214888041fe01ecaec31c6566a0c841af95a43bf29736a67c9e04021c42b1"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027chai\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mocha.setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c37032c21118658993eb2f046429c62e882fa2db4bcb47169600bad2e753e"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027chai-as-promised\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mocha.setup.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"182883fcbab8428e517b31d5e8e13fe7a5fccdc6dbac052c934506ec3d28204c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c529d154a0cf549a8b71be8649765451152effdf0fbefc0de770540ce1614"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6dd1ec396de2016ee6147d7be22d350edb33950958040bab4410c7e33bed6a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"04520835a9c580de4228950fa50bd03b4aff3f5c08b756f327ab6afe4878234c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ad6121ba2a1174c1a0c66ab77d269805c8d2db3b2c48aa0e3476b37a6ba546"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027coveralls-next\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"022f12f83f5883e25d6567c278df9631a888cc729d5a47b60e90e9461651cc58"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027cpx2\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"444ab596101e3b6eaadbb48cc5ba33a8f18318cb00aaaec79ba3f72ecbb17546"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tslib\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"247030b2f0af4b758c04aef11851cfc256a95378bd92cc46651b5308a81409ff"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in dotnet/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea4f65d0c54e73ab55961bfcd4693594f795fd2e7a8c23c61ec6119033c3630"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in dotnet/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1813d79307e4e9ddde7aac054833fc5dd8668cd620000077bb4494b118152d9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in dotnet/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9fb56936f103ccfd4f80556c6c10365d37b3b2c543b66146e3b29ff1a6dcd3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in dotnet/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/package.json"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47e97d07e20310f61f45015054adc0aebb399cb2c59ec033dce7517ff89529"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@commitlint/cli\u0027: Declared in elixir/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b450764d7175d48e891a64b71d842e73613f7a33d623b98959b4bad94e09b8f7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in elixir/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e0f2789963c642240994d9a0a9b14af770ac6aa5601dcce865b20bafc79353"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in elixir/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0341472459e229d11d06fefd8171445004e9a47cde446a07ef00ec33881d5e1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in elixir/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"577bf0bf0cca237c619bd347494cb2ffb9b0ad35b21ffcd119f0df74f3834539"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in elixir/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb198e1f1f4f8d30948bcd5624a5787ec2482783396f8ef911cbcc9941d69c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in php/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf74a586aabeadaa072ccef9161f9538375840601dd198cb6c6f8c7381da643"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in php/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b892978ece489f4e7d66bc44c83290c3a291a4cbd3fdf53fde34ad86714cc68a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in php/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c3b7df9d6e7fa7f993dc5cefd520627e206cb62747381172c241220b50f6df"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in php/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"php/package.json"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"beafcd507e6468813ae6209adfdd24fffe6514d8c5c6b6d122fbf26e7eb0848b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in python/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67fe203beb332a64af70b43cf9d1ed5d60b98069f9a2861f90a42eedf8c4843"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in python/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0ac42180dc1cff5a9b7c1059d670ca64f9a1d6d276bb5f9e5be6d72ad45fd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in python/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4449935f1a6b352097bf9cffe305aef7c8527f927477669cefffe67def78581a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in python/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b26f145184b61e4b8e79f17fa23d5db1bce1f592925095e5394bdf8b89ece6c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027semantic-release-pypi\u0027: Declared in python/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/package.json"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6546c9cf7ae5f7fcaa571cf2cac330be1c35dfd31d6e47cacd59607ab870aa"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/changelog\u0027: Declared in rust/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cd0c5a7139f32b78cda794b4ca7f21d21e49285f446e740b86390aa223d97a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/commit-analyzer\u0027: Declared in rust/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfea04f963eda3f3f85d169dd9022001307356b18d4c246fd99ed5ad5b4fd9d5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/github\u0027: Declared in rust/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d516d314cf7a7e6197377145e7644817171aaad129dd7c3e581478cea331cc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@semantic-release/release-notes-generator\u0027: Declared in rust/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874bb8dd5294bd5d534b42939290d879f71df39e50c1cb5349cd5005df1daf3"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: dotnet/src/BullMQ/BullMQ.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/BullMQ.csproj"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa806428d6fe21fb74887f47a5b93bd585ae3ea60760e64411557940a523d685"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: dotnet/tests/BullMQ.Tests/BullMQ.Tests.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/tests/BullMQ.Tests/BullMQ.Tests.csproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d553236c2d131cb1329244f94b26e900f9732917bfdac4d79ba7808eb7db9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!opts.processed \u0026\u0026 !opts.unprocessed \u0026\u0026 !opts.ignored \u0026\u0026 !opts.failed\u0060 appears character-identically in 2 files \u2014 src/classes/redis-queue-backend.ts, src/postgres/postgres-queue-backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa47a3c6469ed14894a4d5515cc8227aae6f4572abd177e5515a491f589b5f98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(await this.isJobInState(\u0027wait\u0027, jobId)) || (await this.isJobInState(\u0027paused\u0027, jobId))\u0060 appears character-identically in 2 files \u2014 src/classes/redis-queue-backend.ts, src/postgres/postgres-queue-backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"977c27bf2952f1131f208c1bcd6134a0960f2ad44953d6b8dead8917823bbf7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.length === 1 \u0026\u0026 Array.isArray(args[0])\u0060 appears character-identically in 3 files \u2014 src/classes/bun-redis-client.ts, src/classes/node-redis-client.ts, src/classes/valkey-glide-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"259c0825be4eb516dbaf4acae16cc1853555c1af9994e1472a59c751fb3c68dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060client.isCluster \u0026\u0026 typeof client.nodes === \u0027function\u0027\u0060 appears character-identically in 2 files \u2014 src/classes/redis-queue-backend.ts, src/classes/redis-relay-backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98c7556e8cc959b90aa710718db1fb2c171f4f885bd1fad908bb0af8f76c063"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060client.status === \u0027ready\u0027 || (client.status === \u0027connect\u0027 \u0026\u0026 isRedisCluster(client))\u0060 appears character-identically in 2 files \u2014 src/classes/redis-connection.ts, src/classes/redis-queue-backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-connection.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"413de83d3df82b58352f5fb9cef4c633ae04ce2f4402eca6faae0a64adc1cff0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts \u0026\u0026 typeof opts === \u0027object\u0027 \u0026\u0026 opts.connectionName\u0060 appears character-identically in 2 files \u2014 src/classes/bun-redis-client.ts, src/classes/node-redis-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/bun-redis-client.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a27de0860798b28b8fdb50b9f588e3a011ca39308feccd4840b5c61899b69f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.telemetry?.metadata || (!omitContext \u0026\u0026 srcPropagationMetadata)\u0060 appears character-identically in 2 files \u2014 src/classes/flow-producer.ts, src/classes/job-scheduler.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/flow-producer.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb0fa6d58f0b557439ea1c1f5249cc8ada60fd9d0ced39e6247c16571bbdbcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts?.host || process.env.REDIS_HOST || \u0027localhost\u0027\u0060 appears character-identically in 4 files \u2014 vitest.bun.setup.ts, vitest.node-redis.setup.ts, vitest.setup.ts, vitest.valkey-glide.setup.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.bun.setup.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e51a8b28e2265cfce26397567db4dcd7df8d7962ad36bef35a433e3432a51d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts?.port || Number(process.env.REDIS_PORT) || 6379\u0060 appears character-identically in 4 files \u2014 vitest.bun.setup.ts, vitest.node-redis.setup.ts, vitest.setup.ts, vitest.valkey-glide.setup.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.bun.setup.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"141edc65c67737634d869d85a65db6e039b28e5cd0b36a9f0b45c49ce20c8c68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.BULLMQ_TEST_PREFIX || \u0027bull\u0027\u0060 appears character-identically in 2 files \u2014 src/utils/index.ts, vitest.setup.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/index.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d0403d854e4233549130b62cde2628436e3447f12d6069f89e3383256c18ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result === \u0027number\u0027 \u0026\u0026 result \u003C 0\u0060 appears character-identically in 2 files \u2014 src/classes/redis-queue-backend.ts, src/classes/relay-errors.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/classes/redis-queue-backend.ts"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a4f886a890635658809bbb48d7ba2e2a01eeb404b13dc7967990de8ec069e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.Postgres is null \u0026\u0026 opts.Connection is null\u0060 appears character-identically in 2 files \u2014 dotnet/src/BullMQ/QueueEvents.cs, dotnet/src/BullMQ/Worker.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/QueueEvents.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"728b74f92e770b61fcb41f3d1dbcf08c2fd2b8ddc33810e99f917f594ee4ff11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060version and isRedisVersionLowerThan( version, RedisConnection.minimum_version )\u0060 appears character-identically in 2 files \u2014 python/bullmq/queue_events.py, python/bullmq/queue_events_producer.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/queue_events.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"df22b64e8d4c7bbaccd725968c3b6376462970b94865a9e882e511411469b17a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefix.is_empty() || queue_name.is_empty() || job_id.is_empty()\u0060 appears character-identically in 2 files \u2014 rust/src/flow_producer.rs, rust/src/queue.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":"rust/src/flow_producer.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff7d244482604563e3dd0708208555d711911f8c0596fcb7141c3a906d2f34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on unknown code: \u0060FromWireString\u0060 maps every unrecognised code to \u0060JobState.Unknown\u0060, one of the real values, with no log or throw \u2014 a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/JobState.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca46824a846aea90b9508071f47cb52a2687bf2c0523f10a1c01c81ae12715e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060NameToVersion\u0060 falls back to \u00600\u0060 when \u0060int.TryParse(prefix, out var v)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/Postgres/SqlLoader.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a35b206090783c2d369389aa503e696bc8013886b3ccbbdfebd50e8a8f5656"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ToInt\u0060 falls back to \u00600\u0060 when \u0060long.TryParse(s, out var v)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/PostgresBackend.cs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2118ca4987ba8378d5d5df54af4b3634f58cf027c18b85de3fb5d6313447c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ToLong\u0060 falls back to \u00600\u0060 when \u0060long.TryParse((string?)result, out var v)\u0060 is false, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dotnet/src/BullMQ/RedisBackend.cs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eb782a6e41e9e7b72c48128567b19afaded9837968f621f1a35f84d09b8866"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_to_int\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/backends/postgres_backend.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a4d220f5591698f296f0e38c128494bb7026377457b55ad457d953d2656802"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060convert_to_int\u0060 returns \u00600\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/scripts.py"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f568bb507972631c716f2860526675c2ba901450347243b6d63b575f51aeed6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_cluster_nodes\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/bullmq/utils.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566b3eec5569e713290f720b7b9d762bc43cfcfa3f6d7ebdc139b0c241d1ed2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_element_as_u64\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":"rust/src/worker.rs"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"943fa506d51f6f208abbfdd36c0ce30a583b0c10c4c31a32e5d414f12e06a8ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_custom_strategy\u0060 catches \u0060:exit, _\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log what was caught or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backoff.ex"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a39293c32f77714cdb7b0d2ddfe75a3c939bc7336c404021caae4e478b7f909"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode_opts\u0060 matches \u0060{:error, _}\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job.ex"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602cdca59ebf7f4ca14ab44eae4006b7a83bf9675614259568434a79708a631"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060decode_stacktrace\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job.ex"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a76d89fbcf175fd68ce2cf889fa03de2eec9011c0b97abaeab7fd162aa4dc30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060list\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d351045c15c62a5ac6d3a3f635f3ee512b9c7c46ddb8907c195e11ba49c948a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060calculate_next_millis\u0060 matches \u0060{:error, _}\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/job_scheduler.ex"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b317369ee3a56c4dd47b7d54db574436505a3da4f04e016ef0c0a6432f0768e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060get_jobs\u0060 matches \u0060_\u0060 and answers \u0060[]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/queue.ex"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e842eade56550d01b05d5949c3336ffa2b936a2241a040d74968f3f64e1eedb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060get_tracer\u0060 rescues \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13f412b643d6db5a830798a37d1938828125760db1d6226a844e5c0e582373b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060start_span\u0060 rescues \u0060_\u0060 and answers \u0060{:noop, nil}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553ede97fec4220a088c5da02a08d9ecb2a5228d2d9e184d13eb68a21a1601a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060get_current_context\u0060 rescues \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8c897ce029fe83622b7ace8112d278a268c49ab14792b6d5565d107e620b7c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060serialize_context\u0060 rescues \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"639d490eaa9867551e8240faab39acff192ef3d2167bf8973448e7584b8f65ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060deserialize_context\u0060 matches \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e689b0938be826ce6e61ab45981276ec1c9d1e1a160abbfbe2687ad9cd0733c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060trace\u0060 rescues \u0060_\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the exception or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/telemetry/opentelemetry.ex"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d71e0ce1ff78f8e29ac1844c57c9ced3ff097c5b9cfdec0838a43e9d1b474e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060to_jsonb\u0060 matches \u0060_\u0060 and answers \u0060%{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/postgres.ex"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"371bba03c03e17298e171bc6847a06b146c87e2cb9c4823ca5f0f2d193e68ef7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060wait_for_job\u0060 matches \u0060{:error, %Redix.ConnectionError{}}\u0060 and answers \u0060:timeout\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/redis.ex"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e7180c402a34f481f66b4a8aa6f85a325ccd4f490eb97b77a867d5f1f22aa8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060priv_dir\u0060 matches \u0060{:error, _}\u0060 and answers \u0060nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the reason or return the \u0060{:error, reason}\u0060 tuple. If that constant is the correct answer rather than a stand-in for a value that could not be produced, say so in a comment at the clause or in the \u0060@doc\u0060, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"elixir/lib/bullmq/backends/postgres/sql_loader.ex"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9498ebe806c5e9b965db491d42d9176358a9af79aef47b0f935fdcaf163a08f5"}}],"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-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-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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":81,"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."]}]}